#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;

#define rep(i,n) for(int i=0;i<n;i++)
#define ll long long

int n;
int a[50];
vector<bool> seat;
vector<int> ans;
bool solve(vector<bool> seat,int index) {
	rep(i, n) {
		if (!seat[i] && i!=a[index]) {
			seat[i] = true;
			if (index==n-1) {
				ans[index] = i;
				return true;
			}
			if (solve(seat, index + 1)) {
				ans[index] = i;
				return true;
			}
			else seat[i] = false;
		}
	}
	return false;
}

int main() {

	cin >> n;
	seat.resize(n);
	ans.resize(n);
	rep(i, n) {
		cin >> a[i];
	}
	if (solve(seat, 0)) {
		rep(i, n) {
			cout << ans[i] << endl;
		}
	}
	else cout << -1 << endl;
	return 0;
}