def solve():
    N = int(input())

    C = [[] for _ in range(N)]

    for i in range(N):
        a = int(input())
        for j in range(N):
            if j != a:
                C[j].append(i)

    for j in range(N):
        if len(C[j]) == 0:
            print(-1)
            return

    ans = [0] * N
    used = set()
    # ans[i] は i 番を振った人

    def dfs(j):
        if j == N:
            return True
        for k in C[j]:
            if k not in used:
                ans[j] = k
                used.add(k)
                if dfs(j + 1):
                    return True
                used.remove(k)

    if dfs(0):
        l = list(zip(ans, range(N)))
        l.sort()
        for i, j in l:
            print(j)
    else:
        print(-1)


if __name__ == '__main__':
    solve()