//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
//#undef LOCAL




#include <algorithm>

#include <array>

#include <bitset>

#include <cassert>

#include <complex>

#include <cstdio>

#include <cstring>

#include <iostream>

#include <map>

#include <numeric>

#include <queue>

#include <set>

#include <string>

#include <unordered_map>

#include <unordered_set>

#include <vector>

using namespace std;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;

struct Scanner {
    FILE* fp = nullptr;
    char line[(1 << 15) + 1];
    size_t st = 0, ed = 0;
    void reread() {
        memmove(line, line + st, ed - st);
        ed -= st;
        st = 0;
        ed += fread(line + ed, 1, (1 << 15) - ed, fp);
        line[ed] = '\0';
    }
    bool succ() {
        while (true) {
            if (st == ed) {
                reread();
                if (st == ed) return false;
            }
            while (st != ed && isspace(line[st])) st++;
            if (st != ed) break;
        }
        if (ed - st <= 50) reread();
        return true;
    }
    template <class T, enable_if_t<is_same<T, string>::value, int> = 0>
    bool read_single(T& ref) {
        if (!succ()) return false;
        while (true) {
            size_t sz = 0;
            while (st + sz < ed && !isspace(line[st + sz])) sz++;
            ref.append(line + st, sz);
            st += sz;
            if (!sz || st != ed) break;
            reread();
        }
        return true;
    }
    template <class T, enable_if_t<is_integral<T>::value, int> = 0>
    bool read_single(T& ref) {
        if (!succ()) return false;
        bool neg = false;
        if (line[st] == '-') {
            neg = true;
            st++;
        }
        ref = T(0);
        while (isdigit(line[st])) {
            ref = 10 * ref + (line[st++] - '0');
        }
        if (neg) ref = -ref;
        return true;
    }
    template <class T> bool read_single(V<T>& ref) {
        for (auto& d : ref) {
            if (!read_single(d)) return false;
        }
        return true;
    }
    void read() {}
    template <class H, class... T> void read(H& h, T&... t) {
        bool f = read_single(h);
        assert(f);
        read(t...);
    }
    Scanner(FILE* _fp) : fp(_fp) {}
};

struct Printer {
  public:
    template <bool F = false> void write() {}
    template <bool F = false, class H, class... T>
    void write(const H& h, const T&... t) {
        if (F) write_single(' ');
        write_single(h);
        write<true>(t...);
    }
    template <class... T> void writeln(const T&... t) {
        write(t...);
        write_single('\n');
    }

    Printer(FILE* _fp) : fp(_fp) {}
    ~Printer() { flush(); }

  private:
    static constexpr size_t SIZE = 1 << 15;
    FILE* fp;
    char line[SIZE], small[50];
    size_t pos = 0;
    void flush() {
        fwrite(line, 1, pos, fp);
        pos = 0;
    }
    void write_single(const char& val) {
        if (pos == SIZE) flush();
        line[pos++] = val;
    }
    template <class T, enable_if_t<is_integral<T>::value, int> = 0>
    void write_single(T val) {
        if (pos > (1 << 15) - 50) flush();
        if (val == 0) {
            write_single('0');
            return;
        }
        if (val < 0) {
            write_single('-');
            val = -val; // todo min
        }
        size_t len = 0;
        while (val) {
            small[len++] = char('0' + (val % 10));
            val /= 10;
        }
        reverse(small, small + len);
        memcpy(line + pos, small, len);
        pos += len;
    }
    void write_single(const string& s) {
        for (char c : s) write_single(c);
    }
    void write_single(const char* s) {
        size_t len = strlen(s);
        for (size_t i = 0; i < len; i++) write_single(s[i]);
    }
    template <class T> void write_single(const V<T>& val) {
        auto n = val.size();
        for (size_t i = 0; i < n; i++) {
            if (i) write_single(' ');
            write_single(val[i]);
        }
    }
};

Scanner sc = Scanner(stdin);
Printer pr = Printer(stdout);

V<int> solve(V<int> p, int s, int t) {
    int n = int(p.size());
    if (n == 2) {
        return {};
    }
    V<int> b(n, -1);
    if (s != -1) b[s] = t;

    const int L = 3;
    int l = min(n, L);

    set<int> st;
    for (int i = 0; i < n; i++) {
        st.insert(i);
    }

    for (int i = 0; i < n - L; i++) {
        if (b[i] == -1) {
            b[i] = *st.begin();
            if (i && p[b[i - 1]] == b[i]) {
                b[i] = *next(st.begin());
            }
        }
        st.erase(b[i]);
    }
    for (int i = max(0, n - L); i < n; i++) {
        b[i] = *st.begin();
        st.erase(b[i]);
    }
    do {
        bool ok = true;
        for (int i = max(0, n - 10); i < n - 1; i++) {
            if (p[b[i]] == b[i + 1]) ok = false;
        }
        if (!ok) continue;
        return b;
    } while (next_permutation(b.end() - l, b.end()));
    assert(s == -1);
    V<int> buf(3);
    for (int i = 0; i < 3; i++) buf[i] = p[b[n - 1 - i]];
    sort(buf.begin(), buf.end());
    int sp = buf[1]; // mid
    for (int i = max(0, n - l - 1); i >= -1; i--) {
        if (i == -1 || p[b[i]] != sp) {
            return solve(p, i + 1, sp);
        }
    }
    assert(false);
}

int main() {
    int n;
    sc.read(n);
    V<int> p(n);
    for (int i = 0; i < n; i++) {
        sc.read(p[i]);
        p[i]--;
    }
    auto b = solve(p, -1, -1);
    if (b.empty()) {
        pr.writeln(-1);
        return 0;
    }
    for (int d: b) {
        pr.write(d + 1);
        pr.write(' ');
    }
    pr.writeln();
/*
    const int B = 6;
    V<int> b(B);
    auto dfs = [&](auto self, int p) {
        if (p == B) {
//            dbg(b);
            solve(b, -1, -1);
            return;
        }
        for (int i = 0; i < B; i++) {
            b[p] = i;
            self(self, p + 1);
        }
    };
    dfs(dfs, 0);*/
}


Measured memory_bytes: 6912