#include <bits/stdc++.h>
 
using namespace std;

const int MAX = 50;
 
int N, M, A[MAX], B[MAX];
vector<int> adj[MAX];
bool visited[MAX];
 
bool dfs(int a){
    visited[a] = true;
    for(int b: adj[a]){
        if(B[b] == -1 || !visited[B[b]] && dfs(B[b])){
            A[a] = b;
            B[b] = a;
            return true;
        }
    }
    return false;
}

int main(void)
{
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin >> N;

	for(int i=0;i<N;i++)
	{
		cin >> M;
		for(int j=0;j<N;j++)
		{
			if(j==M) continue;
			adj[i].push_back(j);
		}
	}

	memset(A,-1,sizeof(A));
	memset(B,-1,sizeof(B));

	for(int i=0;i<N;i++)
	{
		if(A[i]==-1)
		{
			memset(visited,false,sizeof(visited));
			if(!dfs(i))
			{
				cout << -1 << '\n';
				return 0;
			}
		}
	}

	for(int i=0;i<N;i++)
	{
		cout << A[i] << '\n';
	}
	return 0;
}