# include <iostream>
# include <algorithm>
#include <array>
# include <cassert>
#include <cctype>
#include <climits>
#include <numeric>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <tuple>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
# include <chrono>
# include <random>
# include <limits.h>
# include <unordered_map>
# include <unordered_set>
# include <deque>
# include <cstdio>
# include <cstring>
#include <stdio.h>
#include <stdlib.h>
#include <cstdint>
#include <cfenv>
//#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
constexpr long long MOD = 1000000000 + 7;
constexpr long long INF = std::numeric_limits<long long>::max();
const double PI = acos(-1);
#define fir first
#define sec second
#define thi third
#define debug(x) cerr<<#x<<": "<<x<<'\n'
typedef pair<LL, LL> Pll;
typedef pair<LL, pair<LL, LL>> Ppll;
typedef pair<LL, pair<LL, bitset<100001>>> Pbll;
typedef pair<LL, pair<LL, vector<LL>>> Pvll;
typedef pair<LL, LL> Vec2;
struct Tll { LL first, second, third; };
typedef pair<LL, Tll> Ptll;
#define rep(i,rept) for(LL i=0;i<rept;i++)
#define Mfor(i,mf) for(LL i=mf-1;i>=0;i--)
LL h, w, n, m, k, s, t, q, sum, last, cnt, ans, a,dt[100];
string str,ss;
struct Edge { LL cost, from, to; };
vector<Edge>vec;
bool f;
char c;
void YN(bool f) {
	if (f)
		cout << "YES" << endl;
	else
		cout << "NO" << endl;
}
void yn(bool f) {
	if (f)
		cout << "Yes" << endl;
	else
		cout << "No" << endl;
}
struct edge { LL to, cap, rev,f; };

struct Maxflow {
	//vec[e.to][e.rev]で逆辺
	vector<vector<edge>>vec;
	Maxflow(LL n) :vec(n + 1) {}
	void addedge(LL from, LL to, LL cap) {
		vec[from].push_back(edge{ to, cap, (LL)vec[to].size(),0 });
		vec[to].push_back(edge{ from, 0, (LL)vec[from].size() - 1,1 });
	}
	LL dfs(vector<bool> &used, LL v, LL t, LL f) {
		if (v == t)return f;
		used[v] = true;
		rep(i, vec[v].size()) {
			edge& e = vec[v][i];
			if (!used[e.to] && e.cap > 0) {
				LL d = dfs(used, e.to, t, min(f, e.cap));
				if (d > 0) {
					e.cap -= d;
					if (e.f == 0&&v>0&&v<100)dt[v] = e.to;
					vec[e.to][e.rev].cap += d;
					return d;
				}
			}
		}
		return 0;
	}
	LL ford(LL s, LL t) {
		LL flow = 0;
		for (;;) {
			vector<bool> used(10000, false);
			LL f = dfs(used, s, t, INF);
			if (f == 0)return flow;
			flow += f;
		}
	}
};
int main() {
	cin >> n;
	Maxflow mf(1000);
	rep(i, n) {
		mf.addedge(0, i + 1, 1);
	}
	rep(i, n) {
		mf.addedge(i + 100, 900, 1);
	}
	rep(i, n) {
		LL x;
		cin >> x;
		rep(j, n)if (x != j)mf.addedge(i + 1, j + 100, 1);
	}
	if (mf.ford(0, 900) == n) {
		rep(i, n)cout << dt[i + 1]-100 << endl;
	}
	else cout << -1 << endl;
	return 0;
}