# coding: utf-8
import array, bisect, collections, copy, heapq, itertools, math, random, re, string, sys, time
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
MOD = 10 ** 9 + 7


def II(): return int(input())
def ILI(): return list(map(int, input().split()))
def IAI(LINE): return [ILI() for __ in range(LINE)]
def IDI(): return {key: value for key, value in ILI()}


def read():
    N = II()
    A = [II() for __ in range(N)]
    return (N, A)


def solve(N, A):
    l_num = list(range(N))
    update = True
    count = 0
    while update:
        count += 1
        update = False
        for i in range(N):
            if i == N - 1:
                if A[i] == l_num[i]:
                    l_num[i], l_num[0] = l_num[0], l_num[i]
                    update = True
            else:
                if A[i] == l_num[i]:
                    l_num[i], l_num[i + 1] = l_num[i + 1], l_num[i]
                    update = True
        
        if count >= 2 * N:
            ans = [-1]
            break
    else:
        ans = l_num
    return ans


def main():
    params = read()
    ans = solve(*params)
    for a in ans:
        print(a)


if __name__ == "__main__":
    main()