#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int, int> ii;
#define SZ(x) (int)((x).size())
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

int main() {
  int n;
  cin >> n;
  vector<int> forbid(n), deg(n);
  for (int i = 0; i < n; ++i) {
    int j;
    cin >> j; --j;
    deg[j]++;
    forbid[i] = j;
  }
  vector<int> ret(n);
  set<int> A;
  for (int i = 0; i < n; ++i) A.insert(i);
  function<bool(int, int)> search =
    [&](int pre, int pos) -> bool {
      if (pos == n) return true;
      if (pre != -1 && A.count(forbid[pre]) && deg[forbid[pre]] == n - 1 - pos) return false;
      for (auto it = A.begin(); it != A.end(); ) {
        int k = *it;
        if (pre != -1 && forbid[pre] == k) {
          ++it;
          continue;
        }
        ret[pos] = k;
        A.erase(k);
        int nk = forbid[k];
        --deg[nk];
        if (search(k, pos + 1)) return true;
        ++deg[nk];
        A.insert(k);
        it = A.upper_bound(k);
      }
      return false;
    };
  bool found = search(-1, 0);
  if (found) {
    for (int i = 0; i < n; ++i) {
      cout << ret[i] + 1 << " \n"[i + 1 == n];
    }
  } else {
    cout << -1 << '\n';
  }
  return 0;
}


Measured memory_bytes: 18172