#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <cassert>
 
using namespace std;
 
#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
 
#define MOD 1000000007

vector<int> v;
vector<int> vv;

unsigned int xor128(void) { 
  static unsigned int x = 123456789;
  static unsigned int y = 362436069;
  static unsigned int z = 521288629;
  static unsigned int w = 88675123; 
  unsigned int t;
 
  t = x ^ (x << 11);
  x = y; y = z; z = w;
  return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); 
}

int check(){
  rep(i,0,v.sz){
    if(v[i]==vv[i]){
      return 0;
    }
  }
  return 1;
}

int main(){
  int n;
  cin>>n;
  if(n<1||50<n)return -1;
  rep(i,0,n){
    int a;
    cin>>a;
    if(a<0||49<a)return -1;
    v.pb(a);
    vv.pb(i);
  }
  set<int> se(all(v));
  if(se.sz==1&&v[0]<n){
    cout << -1 << endl;
    return 0;
  }
  while(1){
    swap(vv[xor128()%n],vv[xor128()%n]);
    if(1==check())break;
  }
  rep(i,0,vv.sz){
    cout << vv[i] << endl;
  }
  return 0;
}