#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <climits>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
//typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define revrep(i, n) for(ll i = (n)-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
#define chmin(x, y) x = min(x, y);
#define chmax(x, y) x = max(x, y);

//const ll INFL = LLONG_MAX;//10^18 = 2^60
const ll INFL = 1LL<<60;
//const int INF = INT_MAX;
const ll INF = 1 << 30;//10^9
ll MOD = 1000000007;
//ll MOD = 998244353;
double EPS = 1e-10;

vector<ll> dy = {0, 1, 0, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, 0, -1, 0, 1, -1, 1, -1, 0};

void pres(double A, ll x = 30){cout << fixed << setprecision(x) << A << endl;}
void BinarySay(ll x, ll y = 60){rep(i, y) cout << (x>>(y-1-i) & 1); cout << endl;}
ll cnt_bit(ll x){return __builtin_popcountll(x);}

ll pow_long(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x; k /= 2;
  }
  return res;
}

ll pow_mod(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2){
      res *= x; res %= MOD;
    }
    x *= x; x %= MOD;
    k /= 2;
  }
  return res;
}

ll inverse(ll x){return pow_mod(x, MOD - 2);};

ll gcd(ll a, ll b){
    if(b == 0) return a;
    return gcd(b, a % b);
}

ll lcm(ll x, ll y){
  ll res = x / gcd(x, y);
  res *= y;
  return res;
};

//コンビネーション
const int MAXcomb = 200010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
//facはn!,finvは1/n!
//invは逆元
void COMinit(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i = 2; i < MAXcomb; i++){
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        finv[i] = finv[i-1] * inv[i] % MOD;
    }
}
ll comb(int n, int k){
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    return fac[n] * finv[k] % MOD * finv[n-k] % MOD;
}

const int MAXkai = 200010;
ll kai_memo[MAXkai];
ll kai(ll N){
  if(kai_memo[N] != 0) return kai_memo[N];
  if(N <= 1) return 1;
  return kai_memo[N] = N * kai(N-1) % MOD;
}


const ll N_ = (1<<18);
ll seg[2*N_-1];
void update(ll k, ll x){
  k += N_-1;
  seg[k] += x;
  while(k > 0){
    k = (k-1)/2;
    seg[k] = max(seg[2*k+1], seg[2*k+2]);
  }
}

ll getmaximum(ll x, ll y, ll k = 0, ll left = 0, ll right = N_){
  if(right <= x || y <= left) return -INFL;
  if(x <= left && right <= y) return seg[k];
  ll mid = (left + right) / 2;
  ll l = getmaximum(x, y, 2*k+1, left, mid);
  ll r = getmaximum(x, y, 2*k+2, mid, right);
  return max(l, r);
}


ll N;
vector<ll> A;

bool ok(ll s, ll V){
  ll M = 0;
  M = max(getmaximum(0, s), getmaximum(s+1, N_));
  if(M == V-1) return 0;
  return 1;
}


void solve(){
  cin >> N;
  A.resize(N);
  rep(i, N){
    cin >> A[i];
    A[i]--;
    update(A[i], 1);
  }
  if(N == 2){
    if(A[0] != 1){
      cout << 1 << " " << 2 << endl;
      return;
    }
    if(A[1] != 0){
      cout << 2 << " " << 1 << endl;
      return;
    }
    cout << -1 << endl;
    return;
  }

  vector<ll> ans;
  set<ll> rest;
  rep(i, N) rest.insert(i);
  while(rest.size() > 3){
    for(auto itr = rest.begin(); itr != rest.end(); itr++){
      if(ans.size() && A[ans.back()] == *itr) continue;
      if(ok(*itr, rest.size())){
        ans.pb(*itr);
        update(A[*itr], -1);
        rest.erase(ans.back());
        break;
      }
    }
  }

  vector<ll> R;
  for(auto itr = rest.begin(); itr != rest.end(); itr++){
    R.pb(*itr);
  }


  do {
    if(ans.size() && A[ans.back()] == R[0]) continue;
    if(A[R[0]] == R[1]) continue;
    if(A[R[1]] == R[2]) continue;
    ans.pb(R[0]);
    ans.pb(R[1]);
    ans.pb(R[2]);
  } while (std::next_permutation(R.begin(), R.end()));

  if(ans.size() < N){
    cout << -1 << endl;
    return;
  }
  rep(i, N){
    cout << ans[i] + 1 << " ";
  }
  cout << endl;

}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  solve();
}


Measured memory_bytes: 9216