def solve():
    n = int(input())
    path = list(map(int, input().split()))

    path[-1] = 1
    path[0] = 1

    available = set(range(1, n + 1))

    for num in path:
        if num in available:
            available.remove(num)

    zeros = path.count(0)
    last_city_index = path.index(0) - 1
    last_city = path[last_city_index]

    if zeros % 2 == 0:
        next_city = path[last_city_index + zeros +
                         1] if (last_city_index + zeros) <= len(path) else 0
        if last_city > next_city:
            missing_path = [next_city if i %
                            2 == 0 else available.pop() for i in range(zeros)]
        else:
            missing_path = [available.pop() if i %
                            2 == 0 else last_city for i in range(zeros)]

    else:
        missing_path = [available.pop() if i % 2 == 0 else last_city
                        for i in range(zeros)]

    missing_path = missing_path[::-1]
    ans = [x if x != 0 else missing_path.pop() for x in path]
    print(" ".join(str(num) for num in ans))


if __name__ == "__main__":
    t = int(input())
    for _ in range(t):
        solve()