#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
constexpr char ln = '\n';
constexpr long long MOD = 1000000007;
//constexpr long long MOD = 998244353;
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return true;} return false; }
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return true;} return false; }
inline int popcount(int x) {return __builtin_popcount(x);}
inline int popcount(long long x) {return __builtin_popcountll(x);}
void print() { cout << "\n"; }
template<class T, class... Args>
void print(const T &x, const Args &... args) {
    cout << x << " ";
    print(args...);
}
///////////////////////////////////////////////////////////////////////////////////////////////////////////////


template<typename T, typename Monoid>
struct SegmentTree {
    Monoid merge;
    T unity;
    int N;
    vector<T> node;

    SegmentTree(Monoid f, T id) : merge(f), unity(id) {}

    void init(int sz) {
        N = 1;
        while (N < sz) N <<= 1;
        node.assign(2*N,unity);
    }

    void set(int k, const T &val) {node[k+N] = val;}

    void build() {
        for (int i = N-1; i > 0; --i) {
            node[i] = merge(node[i<<1|0], node[i<<1|1]);
        }
    }

    // (0-indexed)
    void update(int x, T val) {
        x += N;
        node[x] = val;
        while (x > 1) {
            x >>= 1;
            node[x] = merge(node[x<<1|0], node[x<<1|1]);
        }
    }

    // [l, r) (0-indexed)
    T get(int l, int r) {
        if (l >= r) return unity;
        T resl = unity, resr = unity;
        l += N; r += N;
        while (l < r) {
            if (l & 1) resl = merge(resl, node[l++]);
            l >>= 1;
            if (r & 1) resr = merge(node[--r], resr);
            r >>= 1;
        }
        return merge(resl, resr);
    }

    template<typename C>
    int binarysearch(int s, const C &check, T &acc, int k, int l, int r) {
        if (r-l==1) {
            acc = merge(acc,node[k]);
            return check(acc) ? k - N : -1;
        }
        int m = (l+r)>>1;
        if(m <= s) return binarysearch(s, check, acc, (k<<1)|1, m, r);
        if(s <= l && !check(merge(acc,node[k]))) {
            acc = merge(acc,node[k]);
            return -1;
        }
        int vl = binarysearch(s, check, acc, (k<<1)|0, l, m);
        if(~vl) return vl;
        return binarysearch(s, check, acc, (k<<1)|1, m, r);
    }

    template<typename C>
    int binarysearch(int s, const C &check) {
        T acc = unity;
        return binarysearch(s, check, acc, 1, 0, N);
    }

    T operator[](int x) {return node[x+N];}
};

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int N; cin >> N;
    vector<int> A(N+1,-1);
    rep(i,N) cin >> A[i+1];

    auto f=[](pii a, pii b) {return max(a,b);};
    const pii id = pii(0,-1);
    SegmentTree seg(f,id);
    seg.init(N+1);
    rep(i,N+1) seg.set(i,pii(0,i));
    seg.build();
    for (int i = 1; i <= N; i++) seg.update(A[i],pii(seg[A[i]].first+1,A[i]));
    vector<int> ans(N+1);
    iota(all(ans),0);
    vector<bool> used(N+1);
    for (int i = 1; i <= N; i++) {
        if (N+1-i <= 5) {
            do {
                bool ok = true;
                for (int j = i-1; j < N; j++) {
                    if (A[ans[j]]==ans[j+1]) ok = false;
                }
                if (ok) {
                    for (int j = 1; j <= N; j++) {
                        cout << ans[j] << " ";
                    }
                    cout << ln;
                    return 0;
                }
            } while (next_permutation(ans.begin()+i,ans.end()));
            cout << -1 << ln;
            return 0;
        }
        if (seg.get(0,N+1).first==N-i) {
            int t = seg.get(0,N+1).second;
                if (!used[t]) {
                    for (int j = i; j <= N; j++) {
                    if (ans[j]==t) {
                        for (int k = j-1; k >= i; k--) {
                            swap(ans[k],ans[k+1]);
                        }
                        break;
                    }
                }
                seg.update(A[t],pii(seg[A[t]].first-1,A[t]));
                used[t] = 1;
                continue;
            }
        } 
        if (A[ans[i-1]]==ans[i]) swap(ans[i],ans[i+1]);
        used[ans[i]] = 1;
        seg.update(A[ans[i]],pii(seg[A[ans[i]]].first-1,A[ans[i]]));
    }
}


Measured memory_bytes: 6092