#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
 
int dfs(long long *b,int *ans,long long &use,int n,int m){
	if(((1<<n)-1)==use)return 1;
	if(n==m ){return 0;}
	 
	for(int i=0;i<n;i++){ 
		if((b[m]&(1<<i))&&(use&(1<<i))==0){
			ans[m]=i;
			use^=1<<i; 
			if(dfs(b,ans,use,n,m+1))return 1;
			use^=1<<i;
		}
	}
	return 0;
}
int main(){
	int n;scanf("%d",&n);long long b[101]; 
	int v=0;
	int ans[101];
	long long use=0;
	for(int i=0;i<n;i++){int a;scanf("%d",&a);b[i]=((1<<n)-1)&~(1LL<<a);;v|=b[i];}
	dfs(b,ans,use,n,0);
	if(use==((1<<n)-1))for(int i=0;i<n;i++)printf("%d\n",ans[i]);
	else printf("-1\n"); 
	/*for(int i=0;i<n;i++){
		v^=b[i];
		for(int j=0;j<n;j++){
			if(v&(1<<j)){
				printf("%d\n",j);
				v^=(1<<j);
				break;
			}
		}
	}*/
		
	return 0;
}