//#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>

namespace n91 {

using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

struct rep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
struct revrep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) noexcept {
  if (a < b) {
    return b - a;
  } else {
    return a - b;
  }
}
template <class T> void chmin(T &a, const T &b) noexcept {
  if (b < a) {
    a = b;
  }
}
template <class T> void chmax(T &a, const T &b) noexcept {
  if (a < b) {
    a = b;
  }
}
template <class F> class fix_point : private F {
public:
  explicit constexpr fix_point(F &&f) : F(std::forward<F>(f)) {}

  template <class... Args>
  constexpr decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, std::forward<Args>(args)...);
  }
};
template <class F> constexpr decltype(auto) make_fix(F &&f) {
  return fix_point<F>(std::forward<F>(f));
}
template <class T> T scan() {
  T ret;
  std::cin >> ret;
  return ret;
}

} // namespace n91

#include <algorithm>
#include <iostream>
#include <set>
#include <utility>
#include <vector>

namespace n91 {

void main_() {
  /*
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  //*/
  const usize n = scan<usize>();
  if (n == 2) {
    std::cout << "-1\n";
    return;
  }
  std::vector<usize> a(n);
  for (auto &e : a) {
    e = scan<usize>() - 1;
  }
  std::set<usize> rem;
  for (const usize i : rep(0, n)) {
    rem.insert(i);
  }
  std::vector<usize> ideg(n, 0);
  for (const auto e : a) {
    ideg[e] += 1;
  }
  std::multiset<usize> degs;
  for (const auto e : ideg) {
    degs.insert(e);
  }
  usize ng = n;
  std::vector<usize> ans(n);
  const auto det = [&](const usize v) {
    rem.erase(v);
    ng = a[v];
    {
      auto &d = ideg[a[v]];
      if (d != 0) {
        degs.erase(degs.find(d));
        d -= 1;
        degs.insert(d);
      }
    }
    {
      auto &d = ideg[v];
      if (d != 0) {
        degs.erase(degs.find(d));
        d = 0;
        degs.insert(d);
      }
    }
  };
  for (const usize i : rep(0, n)) {
    if (n - i <= 3) {
      std::vector<usize> r(rem.begin(), rem.end());
      do {
        bool f = r[0] != ng;
        for (const usize i : rep(1, r.size())) {
          if (r[i] == a[r[i - 1]])
            f = false;
        }
        if (f) {
          break;
        }
      } while (std::next_permutation(r.begin(), r.end()));
      for (usize j = 0; j != r.size(); j += 1) {
        ans[i + j] = r[j];
      }
      break;
    }
    if (*degs.rbegin() == n - i - 1) {
      for (const usize j : rep(0, n)) {
        if (ideg[j] == n - i - 1) {
          ans[i] = j;
          det(j);
        }
      }
      continue;
    }
    usize ko = *rem.begin();
    if (ko == ng) {
      ko = *std::next(rem.begin());
    }
    ans[i] = ko;
    det(ko);
  }
  for (const usize i : rep(0, n)) {
    std::cout << ans[i] + 1 << " \n"[i + 1 == n];
  }
}

} // namespace n91

int main() {
  n91::main_();

  return 0;
}


Measured memory_bytes: 12544