// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;


int main(int argc, char const* argv[])
{
  int n; cin >> n;
  vector<int> a(n); cin >> a; rep(i, n)a[i]--;
  if(n == 2){
    cout << -1 << endl;
    return 0;
  }
  vector<int> res; res.reserve(n);
  set<int> st; rep(i, n)st.insert(i);
  rep(i_, n - 1){
    auto itr = st.begin();
    if(sz(res) == 0 || a[res.back()] != *itr){
      res.pb(*itr);
      st.erase(itr);
    }else{
      itr++;
      res.pb(*itr);
      st.erase(itr);
    }
  }
  if(a[res.back()] != *st.begin()){
    res.pb(*st.begin());
  }else{
    int b = *st.begin();
    if(a[res.back()] == b && a[res[sz(res)-2]] == b){
      vector<int> v;
      while(sz(res) > 0 && a[res.back()] == b){
        v.pb(res.back());
        res.pop_back();
      }
      res.pb(b);
      sort(whole(v));
      if(a[b] != v[0]){
        for(auto e: v)res.pb(e);
      }else{
        res.pb(v[1]);
        res.pb(v[0]);
        FOR(j, 2, sz(v))res.pb(v[j]);
      }
    }else{
      vector<int> v; v.pb(res.back()); res.pop_back(); v.pb(res.back()); res.pop_back();
      v.pb(b);
      sort(whole(v));
      do{
        if((sz(res) == 0 || a[res.back()] != v[0]) && a[v[0]] != v[1] && a[v[1]] != v[2]){
          rep(i, 3)res.pb(v[i]);
          break;
        }
      }while(next_permutation(whole(v)));
    }
  }
  rep(i, n)res[i]++;
  rep(i, n){
    cout << res[i] << "\n "[i + 1 != n];
  }
  return 0;
}


Measured memory_bytes: 6272