#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream& operator<<(ostream& o, const pair<T, U>& v) {
  return o << "(" << v.first << ", " << v.second << ")";
}
template <class T>
ostream& operator<<(ostream& o, const vector<T>& v) {
  o << "{";
  for (int i = 0; i < (int)((int)((v).size())); ++i)
    o << (i ? ", " : "") << v[i];
  return o << "}";
}
template <class T, class U>
ostream& operator<<(ostream& o, const map<T, U>& v) {
  o << "{";
  for (const auto& e : v) o << e << ", ";
  return o << "}";
}
template <class T, class U>
ostream& operator<<(ostream& o, const unordered_map<T, U>& v) {
  o << "{";
  for (const auto& e : v) o << e << ", ";
  return o << "}";
}
template <class T>
ostream& operator<<(ostream& o, const set<T>& v) {
  o << "{";
  for (const auto& e : v) o << e << ", ";
  return o << "}";
}
template <class T>
string to_s(const T& v) {
  ostringstream is;
  is << v;
  return is.str();
}
const int dx[] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
const int dy[] = {1, 0, -1, 0, -1, 1, 1, -1, 0};
int main(int argc, char* argv[]) {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vector<int> in(n);
  for (int i = 0; i < (int)(n); ++i) cin >> in[i];
  for (int i = 0; i < (int)(n); ++i) --in[i];
  vector<int> ans(n, -1);
  vector<vector<int> > perms(n + 1);
  for (int i = 0; i < n; ++i) {
    if (in[i] == -1) continue;
    vector<int> perm;
    int cv = i;
    do {
      perm.push_back(cv);
      int b = cv;
      cv = in[cv];
      in[b] = -1;
    } while (cv != i);
    if ((int)((perm).size()) % 2 == 1) {
      for (int j = 0; j < (int)((int)((perm).size())); ++j)
        ans[perm[j]] =
            perm[(j + (int)((perm).size()) / 2 + 1) % (int)((perm).size())];
      continue;
    }
    if (perms[(int)((perm).size())].empty()) {
      perms[(int)((perm).size())] = perm;
      continue;
    }
    for (int j = 0; j < (int)((int)((perm).size())); ++j) {
      ans[perm[j]] =
          perms[(int)((perm).size())][(j + 1) % (int)((perm).size())];
      ans[perms[(int)((perm).size())][j]] = perm[(j) % (int)((perm).size())];
    }
    perms[(int)((perm).size())].clear();
  }
  if (count((ans).begin(), (ans).end(), -1) > 0) {
    cout << -1 << '\n';
    return 0;
  }
  for (int i = 0; i < (int)(n); ++i) {
    if (i) cout << ' ';
    cout << ans[i] + 1;
  }
  cout << '\n';
}
