#include <iostream>
#include <vector>
#include <cstring>
using namespace std;

int N, A[50];

int V;
vector<int> G[100];
int match[100];
bool used[100];

void add_edge(int u, int v){
	G[u].push_back(v);
	G[v].push_back(u);
}

bool dfs(int v){
	used[v] = true;
	for(int u : G[v]){
		int w = match[u];
		if(w < 0 || (!used[w] && dfs(w))){
			match[v] = u;
			match[u] = v;
			return true;
		}
	}
	return false;
}

int bipartite_matching(){
	int res = 0;
	memset(match, -1, sizeof(match));
	for(int v=0;v<V;v++){
		if(match[v] < 0){
			memset(used, false, sizeof(used));
			if(dfs(v)){
				++res;
			}
		}
	}
	return res;
}

int main(){
	cin >> N;
	for(int i=0;i<N;i++){
		cin >> A[i];
	}

	V = N * 2;
	for(int i=0;i<N;i++){
		for(int x=0;x<N;x++){
			if(x != A[i]){
				add_edge(i, N + x);
			}
		}		
	}

	if(bipartite_matching() < N){
		cout << -1 << endl;
		return 0;
	}

	for(int i=0;i<N;i++){
		cout << match[i] - N << endl;
	}
	return 0;
}