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 = len([x for x in path if x == 0])
    last_city = 0
    last_city_index = 0
    for i, x in enumerate(path):
        if x != 0:
            last_city = x
            last_city_index = i
        else:
            break
    next_cities = [x for x in path[last_city_index+1:] if x != 0]
    if next_cities:
        next_city = next_cities[0]
    else:
        next_city = 0

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

    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()