// #define DEBUGGING
#include <bits/stdc++.h>
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
using ll = std::int64_t;
using ull = std::uint64_t;
using PLL = std::pair<ll, ll>;
using TLL = std::tuple<ll, ll, ll>;
template <typename T> using V = std::vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return std::max(low, std::min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { return t = clamp(t, low, high); }
namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; }
#define mv_rec make_v(init, tail...)
template <typename T> T make_v(T init) { return init; }
template <typename T, typename... Tail> auto make_v(T init, size_t s, Tail... tail) { return V<decltype(mv_rec)>(s, mv_rec); }
#undef mv_rec
using namespace std;

#ifdef DEBUGGING
#include "../../debug/debug.cpp"
#else
#define DEBUG(...) 0
#define DEBUG_SEPARATOR_LINE 0
#endif

V<ll> ans;

bool solve() {
    ll N;
    cin >> N;
    V<ll> A(N);
    V<ll> cnt(N);
    for (ll &e : A) {
        cin >> e;
        e--;
        cnt[e]++;
    }

    if (N == 2) return false;

    map<ll, set<ll>> cnt_mp;
    set<ll> rest;
    for (ll i = 0; i < N; i++) {
        cnt_mp[cnt[i]].insert(i);
        rest.insert(i);
    }

    auto push = [&](ll val) {
        ll dl = A[val];
        ll c = cnt[dl];
        cnt_mp[c].erase(dl);
        cnt_mp[c - 1].insert(dl);
        cnt[dl]--;
        ans.push_back(val);
        cnt_mp[cnt[val]].erase(val);
        rest.erase(val);
    };

    for (ll i = 0; i < N - 5; i++) {
        ll oth = N - i - 1;
        auto ite = cnt_mp.find(oth);
        ll val;
        if (ite != cnt_mp.end() && ite->second.size()) {
            val = *(ite->second.begin());
        } else {
            val = *(rest.begin());
            if (ans.size() && A[ans.back()] == val) {
                ll tmp = val;
                rest.erase(val);
                val = *(rest.begin());
                rest.insert(tmp);
            }
        }
        push(val);
    }

    V<ll> lis;
    for (ll e : rest) lis.push_back(e);
    sort(ALL(lis));
    bool ok = true;
    do {
        ok = true;
        if (ans.size()) {
            ll d = ans.back();
            if (A[d] == lis.front()) continue;
        }
        for (ll i = 0; i + 1 < lis.size(); i++) {
            ll a = lis[i], b = lis[i + 1];
            if (A[a] == b) ok = false;
        }
        if (ok) break;
    } while (next_permutation(ALL(lis)));
    if (!ok) return false;
    for (ll e : lis) ans.push_back(e);
    return true;
}

int main() {
    if (solve()) {
        for (ll i = 0; i < ans.size(); i++) cout << ans[i] + 1 << " \n"[i + 1 == ans.size()];
    } else {
        cout << -1 << endl;
    }
    return 0;
}


Measured memory_bytes: 12416