import sys

sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *

int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def SI(): return sys.stdin.readline()[:-1]
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def MF(): return map(float, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
dij = [(0, 1), (1, 0), (0, -1), (-1, 0)]

def main():
    def dfs(i=0):
        if i==n:return True
        for no in range(n):
            if used[no]:continue
            if no==ng[i]:continue
            used[no]=True
            ans[i]=no
            if dfs(i+1):return True
            used[no]=False
        return False

    n=II()
    ng=[II() for _ in range(n)]
    used=[False]*n
    ans=[-1]*n
    if dfs():print(*ans,sep="\n")
    else:print(-1)

main()