#include <bits/stdc++.h>
using namespace std;
const int NMAX = 1000000;
int p[NMAX + 1], vis[NMAX + 1];
int dfs(int v) {
  vis[v] = 1;
  if (vis[p[v]] == 1)
    return 1;
  else
    return dfs(p[v]) + 1;
}
int main() {
  ios_base::sync_with_stdio(0);
  int n;
  cin >> n;
  int q[n + 1];
  for (int i = 1; i <= n; i++) cin >> p[i];
  for (int i = 1; i <= n; i++) vis[i] = 0;
  vector<pair<int, int> > cycles;
  for (int i = 1; i <= n; i++) {
    if (vis[i] == 0) {
      int c = dfs(i);
      if (c % 2 == 0)
        cycles.push_back(make_pair(c, i));
      else {
        vector<int> cyc;
        int now = i;
        for (int j = 0; j < c; j++) {
          cyc.push_back(now);
          now = p[now];
        }
        for (int j = 0; j < c; j++) q[cyc[j]] = cyc[(j + c / 2 + 1) % c];
      }
    }
  }
  if (cycles.size() % 2 == 1) {
    cout << "-1";
    return 0;
  }
  sort(cycles.begin(), cycles.end());
  for (int i = 0; i < cycles.size(); i += 2) {
    if (cycles[i].first != cycles[i + 1].first) {
      cout << "-1";
      return 0;
    }
    int c1 = cycles[i].second;
    int c2 = cycles[i + 1].second;
    do {
      q[c1] = c2;
      q[c2] = p[c1];
      c1 = p[c1];
      c2 = p[c2];
    } while (c1 != cycles[i].second);
  }
  for (int i = 1; i <= n; i++) cout << q[i] << " ";
}
