#include <bits/stdc++.h>
using namespace std;
int n, p[1000005], q[1000005], vis[1000005], k;
vector<int> t, te;
vector<vector<int> > adj;
void dfs(int u) {
  vis[u] = 1;
  t.push_back(u);
  if (!vis[p[u]]) dfs(p[u]);
}
int main() {
  cin >> n;
  memset(vis, 0, sizeof(vis));
  adj.assign(n + 10, vector<int>(0));
  for (int i = 1; i <= n; i++) scanf("%d", &p[i]);
  for (int i = 1; i <= n; i++) {
    if (!vis[i]) {
      t.clear();
      dfs(i);
      if (t.size() % 2) {
        k = (t.size() - 1) / 2;
        for (int i = 0; i < k; i++)
          q[t[i]] = t[k + i + 1], q[t[k + i + 1]] = t[i + 1];
        q[t[k]] = t[0];
      } else {
        k = t.size();
        if (adj[k].empty())
          adj[k] = t;
        else {
          te = adj[k];
          adj[k].clear();
          for (int i = 0; i < k; i++) {
            q[t[i]] = te[i];
            if (i < k - 1) q[te[i]] = t[i + 1];
          }
          q[te[k - 1]] = t[0];
        }
      }
    }
  }
  k = 1;
  for (int i = 1; i <= n; i++)
    if (!adj[i].empty()) k = 0;
  if (k)
    for (int i = 1; i <= n; i++) printf("%d ", q[i]);
  else
    cout << -1;
  cout << endl;
  return 0;
}
