#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)

#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif

#include <limits.h>
#include <math.h>
#include <time.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << '\n'
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
#define int long long
#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << ((i == v.size() - 1) ? "\n" : " ")
template <typename T1, typename T2> inline void chmin(T1& a, T2 b) {
	if (a > b) a = b;
}
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) {
	if (a < b) a = b;
}
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef array<int, 3> arr3;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 998244353;
constexpr int MAX = 500050;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e18 + 1;
constexpr int INF = 1e18 + 1;

bool dfs(int N, int depth,vector<int>&A,vector<int>&ans, set<int>&cand) {
	if (depth == N)return true;
	int l = -1;
	int sz = cand.size();
	REP(_, sz+1) {
		auto itr = cand.upper_bound(l);
		if (itr == cand.end())return false;
		l = *itr;
		if (depth == 0) {
			ans.push_back(l);
			cand.erase(l);
			if (dfs(N, depth + 1, A, ans, cand))return true;
			else {
				ans.pop_back();
				cand.insert(l);
			}
		}
		else {
			if (A[ans[depth-1]] == l)continue;
			else {
				ans.push_back(l);
				cand.erase(l);
				if (dfs(N, depth + 1, A, ans, cand))return true;
				else{
					ans.pop_back();
					cand.insert(l);
				}
			}
		}
	}
}


int N;
vector<int> p;
vector<set<int>>ip;
bool check(const vector<int> &res) {
	REP(i, res.size() - 1) {
		if (res[i + 1] == p[res[i]])return false;
	}
	return true;
}

void last(vector<int> &res, vector<int> &rem) {
	do {
		if (res.size() > 0 && rem[0] == p[res.back()])continue;
		if (check(rem)) {
			REP(i, res.size())cout << res[i] + 1 << " ";
			REP(i, rem.size())cout << rem[i] + 1 << " ";
			cout << endl;
			return;
		}
	} while (next_permutation(rem.begin(), rem.end()));
	cout << -1 << endl;
	return;
}

const int REM = 5;
void solve() {
	cin >> N;
	p.resize(N);
	ip.assign(N, set<int>());
	REP(i, N) {
		cin >> p[i];
		p[i]--;
		ip[p[i]].insert(i);
	}
	if (N <= REM) {
		vector<int>res, rem(N);
		REP(i, N)rem[i] = i;
		last(res, rem);
		return;
	}
	vector<int>res;
	set<int>rem;
	REP(i, N)rem.insert(i);
	while (N - res.size() > REM) {
		int bad = -1;
		if (res.size() > 0)bad = p[res.back()];

		//Greedy
		int nxt = -1;
		for (auto it : rem) {
			if (it == bad)continue;
			nxt = it;
			break;
		}
		//nxtを選ぶと詰むとき
		if (ip[p[nxt]].size() + res.size() == N - 1) {
			nxt = p[nxt];
		}
		res.push_back(nxt);
		rem.erase(nxt);
		ip[p[nxt]].erase(nxt);
	}
	vector<int>vrem;
	REP(i, N)if (rem.count(i))vrem.push_back(i);
	last(res, vrem);
}



signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	mt.seed((int)(time(0)));
	//REP(_, 10000)test();
	//int q;
	//cin >> q;
	//while (q--)
	solve();
}



Measured memory_bytes: 15744