#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<string>
#include<algorithm>
#include<functional>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define INF 1<<30
#define MP make_pair
#define mp make_pair
#define pb push_back
#define PB push_back
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define ll long long
#define ull unsigned long long
int n;
bool check(vector<int> &ans, vector<int> a){
	bool f=true;
	REP(i,n){if(ans[i]==a[i]){f=false;break;}}
	if(f) return f;
	swap(ans[rand()%n],ans[rand()%n]);
	return f;
}

int main(){
	cin>>n;
	bool f=true;
	vector<int> a(n);
	vector<int> ans(n);
	REP(i,n) cin>>a[i];
	int ck=a[0];
	REP(i,n){
		if(a[0]!=a[i]){f=false;break;}
	}
	if(a[0]>=n) f=false;
	if(n==1 && a[0]==0) f=true;
	if(f) {cout<<"-1"<<endl;return 0;}
	REP(i,n) ans[i]=i;
	while(!check(ans,a)){
	}
	REP(i,n) cout<<ans[i]<<endl;
	return 0;
}