#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include "bits/stdc++.h"
#define REP(i,a,b) for(i=a;i<b;++i)
#define rep(i,n) REP(i,0,n)
#define ll long long
#define ull unsigned ll
typedef long double ld;
#define SQR(X)  ( (X)*(X) )
#define CUBE(X) ( (X)*(X)*(X) )
#define ALL(a) (a).begin(),(a).end()
#define ifnot(a) if(not a)
#define dump(x)  cerr << #x << " = " << (x) << endl
using namespace std;


void reader(int &a){scanf("%d",&a);}
void reader(double &a){scanf("%lf",&a);}
void reader(char a[]){scanf("%s",a);}
void reader(char &a){scanf(" %c",a);}
void reader(ll &a){scanf("%lld",&a);}
void reader(ull &a){scanf("%llu",&a);}
// void reader(string& a){cin >> a;};
template<class T,class U> void reader(T& t,U& u){reader(t); reader(u);}
template<class T,class U,class V> void reader(T& t,U& u,V& v){reader(t); reader(u); reader(v);}

void writer(int a,char c) {printf("%d",a); putchar(c);}
void writer(ll a,char c) {printf("%lld",a); putchar(c);}
void writer(ull a,char c) {printf("%llu",a); putchar(c);}
void writer(double a,char c) {printf("%.20lf",a); putchar(c);}
void writer(char a[]) {printf("%s",a);};
void writer(char a[],char c) {printf("%s",a);putchar(c);};
void writer(char a,char c) {putchar(a); putchar(c);};
template<class T>void writerLn(T t){writer(t,'\n');}
template<class T,class U>void writerLn(T t,U u){writer(t,' ');writer(u,'\n');}
template<class T,class U,class V> void writerLn(T t,U u,V v){writer(t,' ');writer(u,' ');writer(v,'\n');}
template<class T> void writerArr(T x[], int n){int i;if(!n){putchar('\n');return;}rep(i,n-1) writer(x[i],' ');writer(x[n-1],'\n');}
template<class T> void writerVec(vector<T> x){int n=x.size();int i;if(!n){putchar('\n');return;}rep(i,n-1) writer(x[i],' ');writer(x[n-1],'\n');}

vector<string> split(const string &str, char sep){vector<string> v;stringstream ss(str);string buffer;while(getline(ss,buffer,sep)){v.push_back(buffer);}return v;}

// #define int ll
bool test = 1;
int dx[] = {0,0,1,-1};
int dy[] = {1,-1,0,0};
#define MAX 300000
//.....................
ll mod = (int)1e9+7;

int A[50];
signed main() {
  int i,j,k;
  int N;
  multiset<int> ms;
  cin >> N;
  rep(i,N) {
    reader(A[i]);
    ms.insert(A[i]);
  }
  bool correct = true;
  rep(i,N) {
    if(ms.count(i) == N) correct = false;
  }
  ifnot(correct) {
    puts("-1");
    return 0;
  }
  set<int> s2;
  vector<int> v(N);
  rep(i,N) {
    rep(j,500) {
      int a = rand()%N;
      if(a == A[i]) continue;
      if(s2.find(a) != s2.end()) continue;
      s2.insert(a);
      v[i] = a;
      break;
    }
    if(j==500) {
      i = -1;
      s2.clear();
    }
  }
  rep(i,v.size()) {
    printf("%d\n",v[i]);
  }
  return 0;
}