#include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename L> using gpp_map = tree<T, L, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using gpp_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;*/
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl; }
#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;} }
#define Return(ans) { cout << (ans) << endl; return 0; }
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;
//#define Add(x, y) x = (x + (y)) % mod
//#define Mult(x, y) x = (x * (y)) % mod

void showans(vec ans){
    REP(i, SZ(ans)) cout << ans[i] + 1 << ' ';
    cout << endl;
}

signed main(){

    int N; cin >> N;
    vec a(N); cin >> a;
    REP(i, N) a[i]--;

    if(N == 2 && a[0] == 1 && a[1] == 0){
        Return(-1);
    }

    set<int> s;
    FOR(i, 1, N) s.insert(i);
    vec ans(N);
    ans[0] = 0;
    FOR(i, 1, N - 1){
        auto it = s.begin();
        if(*it == a[ans[i - 1]]) it++;
        ans[i] = *it;
        s.erase(it);
    }

    int las = *(s.begin());
    if(a[ans[N - 2]] != las){
        ans[N - 1] = las;
        showans(ans);
        return 0;
    }

    int i0 = N - 2;
    while(i0 > 0 && a[ans[i0 - 1]] == las) i0--;

    s.erase(all(s));
    FOR(i, 0, N) s.insert(i);
    if(i0 == 0) ans[0] = las;
    else ans[0] = 0;

    bool f = true;
    s.erase(ans[0]);
    FOR(i, 1, N){
        if(i == i0){
            ans[i] = las;
            s.erase(las);
        }else{
            auto it = s.begin();
            if(*it == a[ans[i - 1]]){
                if(i < N - 1) it++;
                else f = false;
            }
            ans[i] = *it;
            s.erase(it);
        }
    }
    if(f){
        showans(ans);
        return 0;
    }

    int x = ans[N - 3], y = min(ans[N - 2], ans[N - 1]), z = max(ans[N - 2], ans[N - 1]);
    if(N >= 4 && a[ans[N - 4]] != y){
        ans[N - 3] = y;
        ans[N - 2] = x;
        ans[N - 1] = z;
    }else{
        ans[N - 3] = z;
        ans[N - 2] = x;
        ans[N - 1] = y;
    }
    showans(ans);

    return 0;
}


Measured memory_bytes: 7040