/*
    author:  Maksim1744
    created: 11.01.2020 15:32:19
*/

#include <bits/stdc++.h>

using namespace std;

#define ll   long long
#define ld   long double

#define mp   make_pair
#define pb   push_back
#define eb   emplace_back

#define sum(a)     ( accumulate ((a).begin(), (a).end(), 0ll))
#define mine(a)    (*min_element((a).begin(), (a).end()))
#define maxe(a)    (*max_element((a).begin(), (a).end()))
#define mini(a)    ( min_element((a).begin(), (a).end()) - (a).begin())
#define maxi(a)    ( max_element((a).begin(), (a).end()) - (a).begin())
#define lowb(a, x) ( lower_bound((a).begin(), (a).end(), (x)) - (a).begin())
#define uppb(a, x) ( upper_bound((a).begin(), (a).end(), (x)) - (a).begin())

template<typename T>             vector<T>& operator--            (vector<T>& v){for (auto& i : v) --i;            return  v;}
template<typename T>             vector<T>& operator++            (vector<T>& v){for (auto& i : v) ++i;            return  v;}
template<typename T>             istream& operator>>(istream& is,  vector<T>& v){for (auto& i : v) is >> i;        return is;}
template<typename T>             ostream& operator<<(ostream& os,  vector<T>& v){for (auto& i : v) os << i << ' '; return os;}
template<typename T, typename U> istream& operator>>(istream& is, pair<T, U>& p){is >> p.first >> p.second;        return is;}
template<typename T, typename U> ostream& operator<<(ostream& os, pair<T, U>& p){os << p.first << ' ' << p.second; return os;}
template<typename T, typename U> pair<T,U> operator-(pair<T,U> a, pair<T,U> b){return mp(a.first-b.first, a.second-b.second);}
template<typename T, typename U> pair<T,U> operator+(pair<T,U> a, pair<T,U> b){return mp(a.first+b.first, a.second+b.second);}
template<typename T, typename U> void umin(T& a, U b){if (a > b) a = b;}
template<typename T, typename U> void umax(T& a, U b){if (a < b) a = b;}

#ifdef HOME
#define TAG_LENGTH       25
#define LR_LEFT          left
#define LR_RIGHT         right
#define LR_VALUE         value
#define LR_SECOND_VALUE  mn
#include "C:/C++ libs/print.cpp"
#else
#define showl            42;
#define shows            42;
#define show(...)        42;
#define showm(...)       42;
#define showt(...)       42;
#define printTree(...)   42;
#define printGraph(...)  42;
#define printLRTree(...) 42;
#define printMatrix(...) 42;
#define printWGraph(...) 42;
#define debug     if (false)
#endif

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

    int n;
    cin >> n;
    vector<int> rule(n);
    cin >> rule;
    rule.insert(rule.begin(), 0);
    ++n;
    vector<int> p = {0};
    vector<int> bcnt(n, 0);
    for (int i = 0; i < n; ++i) {
        bcnt[rule[i]]++;
    }
    auto check = [&]() {
        for (int i = n - 2; i >= 0; --i) {
            if (rule[p[i]] == p[i + 1])
                return false;
        }
        return true;
    };
    set<int> has;
    for (int i = 1; i < n; ++i)
        has.insert(i);
    while (has.size() > 3) {
        auto it = has.begin();
        if (*it == rule[p.back()]) ++it;
        int a = *it;
        if (has.count(rule[a]) && bcnt[rule[a]] == has.size() - 1)
            a = rule[a];
        p.pb(a);
        bcnt[rule[p.back()]]--;
        has.erase(a);
    }
    for (auto t : has) {
        p.pb(t);
    }
    show(p);
    int k = min(n - 1, 5), f = 120;
    for (int i = 0; i < f; ++i) {
        if (check()) {
            break;
        }
        next_permutation(p.begin() + n - k, p.end());
    }
    if (check()) {
        p.erase(p.begin());
    } else {
        p = {-1};
    }
    cout << p << endl;

    return 0;
}


Measured memory_bytes: 6264