#line 1 "main.cpp"
#include <bits/stdc++.h>
#line 2 "/home/ubuntu/Library/data_structure/segment_tree.hpp"
#include <algorithm>
#include <cassert>
#include <vector>
#line 2 "/home/ubuntu/Library/utils/macros.hpp"
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#define REP_R(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i))
#define REP3R(i, m, n) for (int i = (int)(n) - 1; (i) >= (int)(m); -- (i))
#define ALL(x) std::begin(x), std::end(x)
#line 6 "/home/ubuntu/Library/data_structure/segment_tree.hpp"

/**
 * @brief a segment tree / セグメント木
 * @docs data_structure/segment_tree.md
 * @tparam Monoid (commutativity is not required)
 */
template <class Monoid>
struct segment_tree {
    typedef typename Monoid::value_type value_type;
    const Monoid mon;
    int n;
    std::vector<value_type> a;
    segment_tree() = default;
    segment_tree(int n_, const Monoid & mon_ = Monoid()) : mon(mon_) {
        n = 1; while (n < n_) n *= 2;
        a.resize(2 * n - 1, mon.unit());
    }
    void point_set(int i, value_type b) {  // 0-based
        assert (0 <= i and i < n);
        a[i + n - 1] = b;
        for (i = (i + n) / 2; i > 0; i /= 2) {  // 1-based
            a[i - 1] = mon.mult(a[2 * i - 1], a[2 * i]);
        }
    }
    value_type range_get(int l, int r) {  // 0-based, [l, r)
        assert (0 <= l and l <= r and r <= n);
        value_type lacc = mon.unit(), racc = mon.unit();
        for (l += n, r += n; l < r; l /= 2, r /= 2) {  // 1-based loop, 2x faster than recursion
            if (l % 2 == 1) lacc = mon.mult(lacc, a[(l ++) - 1]);
            if (r % 2 == 1) racc = mon.mult(a[(-- r) - 1], racc);
        }
        return mon.mult(lacc, racc);
    }

    value_type point_get(int i) {  // 0-based
        assert (0 <= i and i < n);
        return a[i + n - 1];
    }

    /**
     * @brief a fast & semigroup-friendly version constructor
     * @note $O(n)$
     */
    template <class InputIterator>
    segment_tree(InputIterator first, InputIterator last, const Monoid & mon_ = Monoid()) : mon(mon_) {
        int size = std::distance(first, last);
        n = 1; while (n < size) n *= 2;
        a.resize(2 * n - 1, mon.unit());
        std::copy(first, last, a.begin() + (n - 1));
        unsafe_rebuild();
    }
    /**
     * @brief update a leaf node without updating ancestors
     * @note $O(1)$
     */
    void unsafe_point_set(int i, value_type b) {  // 0-based
        assert (0 <= i and i < n);
        a[i + n - 1] = b;
    }
    /**
     * @brief re-build non-leaf nodes from leaf nodes
     * @note $O(n)$
     */
    void unsafe_rebuild() {
        REP_R (i, n - 1) {
            a[i] = mon.mult(a[2 * i + 1], a[2 * i + 2]);
        }
    }
};
#line 2 "/home/ubuntu/Library/monoids/max.hpp"
#include <algorithm>
#include <limits>

template <class T>
struct max_monoid {
    typedef T value_type;
    value_type unit() const { return std::numeric_limits<T>::lowest(); }
    value_type mult(value_type a, value_type b) const { return std::max(a, b); }
};
#line 4 "main.cpp"
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#define REP_R(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i))
#define REP3R(i, m, n) for (int i = (int)(n) - 1; (i) >= (int)(m); -- (i))
#define ALL(x) std::begin(x), std::end(x)
using namespace std;

vector<int> solve(int n, const vector<int> & a) {
    if (n == 2) return vector<int>();

    vector<int> freq(n);
    for (int a_i : a) {
        ++ freq[a_i];
    }
    segment_tree<max_monoid<int> > segtree(n);
    REP (i, n) {
        segtree.unsafe_point_set(i, freq[i]);
    }
    segtree.unsafe_rebuild();

    vector<int> b;
    set<int> available;
    vector<int> cur;
    REP (i, n) {
        available.insert(i);
    }
    ([go = [&](auto go) {
        if (available.empty()) {
            b = cur;
            return;
        }
        auto use = [&](int i) {
            if (not cur.empty() and a[cur.back()] == i) return;
            available.erase(i);
            cur.push_back(i);
            segtree.point_set(i, segtree.point_get(i) - n);
            segtree.point_set(a[i], segtree.point_get(a[i]) - 1);
// cerr << "push " << i << endl;
            go(go);
// if (b.empty()) cerr << "pop " << i << endl;
            segtree.point_set(i, segtree.point_get(i) + n);
            segtree.point_set(a[i], segtree.point_get(a[i]) + 1);
            cur.pop_back();
            available.insert(i);
        };
        if (segtree.range_get(0, n) == (int)available.size() - 1) {
            for (auto it = available.begin(); it != available.end(); ++ it) {
                int i = *it;
                if (segtree.range_get(0, n) == segtree.point_get(i)) {
                    use(i);
                }
                it = available.find(i);
            }
            return;
        }
        for (auto it = available.begin(); it != available.end(); ++ it) {
            int i = *it;
            use(i);
            it = available.find(i);
            if (not b.empty()) break;
        }
    }]() { return go(go); })();
    assert (not b.empty());
    return b;
}

int main() {
    int n; scanf("%d", &n);
    vector<int> a(n);
    REP (i, n) {
        scanf("%d", &a[i]);
        -- a[i];
    }
    auto b = solve(n, a);
    if (b.empty()) {
        printf("%d\n", -1);
    } else {
        REP (i, n) {
            printf("%d%c", b[i] + 1, i + 1 < n ? ' ' : '\n');
        }
    }
    return 0;
}


Measured memory_bytes: 23296