#include <bits/stdc++.h>
using namespace std;
int a[1000000 + 1];
int goes_to[1000000 + 1];
int ans[1000000 + 1];
int true_ans[1000000 + 1];
bool vis[1000000 + 1];
vector<vector<int> > even_cycles;
map<int, int> even_indices;
bool solvable() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    goes_to[a[i]] = i;
  }
  even_cycles.push_back(vector<int>());
  memset(ans, -1, sizeof ans);
  memset(vis, false, sizeof vis);
  for (int i = 1; i <= n; i++)
    if (!vis[i]) {
      vis[i] = true;
      vector<int> cycle;
      cycle.push_back(i);
      int u = goes_to[i];
      while (u != i) {
        vis[u] = true;
        cycle.push_back(u);
        u = goes_to[u];
      }
      if (cycle.size() & 1) {
        int step = (cycle.size() + 1) / 2;
        for (u = 0; u < step; u++) {
          ans[cycle[u]] = cycle[(u + step) % cycle.size()];
          ans[cycle[(u + step) % cycle.size()]] = cycle[(u + 1) % cycle.size()];
        }
      } else {
        if (even_indices[cycle.size()] == 0) {
          even_indices[cycle.size()] = even_cycles.size();
          even_cycles.push_back(cycle);
        } else {
          int q = even_indices[cycle.size()];
          even_indices[cycle.size()] = 0;
          for (int u = 0; u < cycle.size(); u++) {
            ans[cycle[u]] = even_cycles[q][u];
            ans[even_cycles[q][u]] = cycle[(u + 1) % cycle.size()];
          }
        }
      }
    }
  for (int i = 1; i <= n; i++)
    if (ans[i] == -1)
      return false;
    else
      true_ans[ans[i]] = i;
  for (int i = 1; i <= n; i++) cout << true_ans[i] << (i == n ? '\n' : ' ');
  return true;
}
int main() {
  if (!solvable()) cout << -1 << endl;
  return 0;
}
