#include<iostream>
#include<fstream>
#include<sstream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<vector>
#include<list>
#include<algorithm>
#include<utility>
#include<complex>
#include<functional>
using namespace std;


#define input_init stringstream ss; string strtoken, token; istringstream is
#define input_line  getline(cin, strtoken);is.str(strtoken);is.clear(istringstream::goodbit)
#define input_token(num) ss.str(""); ss.clear(stringstream::goodbit); getline(is, token, ','); ss << token; ss >> num

int used[102];
int flow[102][102];
list<int> bfs(){

	queue<int> q;
	q.push(0);
	for(int i=0;i<102;i++)
		used[i] = -1;
	used[0] = 0;
	while (q.empty() == false){
		int v = q.front(); q.pop();
		for(int i=0;i<=102;i++){
			if (used[i] == -1 && flow[v][i]>0){
				used[i] = v;
				q.push(i);
			}
		}
	}
	if (used[101] == -1)return list<int>();
	int x = 101;
	list<int> res;
	res.push_back(101);
	while (x != 0){
		x = used[x];
		res.push_front(x);
	}
	return res;

}

int main(void){
	int N;
	cin >> N;
	for (int i = 1; i <= N; i++){
		flow[0][i] = 1;
		flow[50 + i][101] = 1;
		int a;
		cin >> a;
		for (int j = 51; j <=50+N; j++){
			if (a + 51 != j)
				flow[i][j] = 1;
		}
	}
	int res = 0;
	while (1){
		auto path = bfs();
		vector<int> p(path.begin(),path.end()); 
		if (p.empty())break;
		res++;
		for(int i=1;i<(int)p.size();i++){
			flow[p[i - 1]][p[i]] -= 1;
			flow[p[i]][p[i - 1]] += 1;
		}
	}
	if (res==N)
	for (int i = 1; i <= N; i++){
		for (int j = 51; j <= 50+ N; j++){
			if (flow[j][i])
				cout << j - 51 << endl;
		}
	}
	else cout << -1<< endl;

	return(0);
}