#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int a[N], vis[N];
vector<vector<int> > v[N];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  vector<int> tt;
  for (int i = 1; i <= n; i++) {
    if (!vis[i]) {
      tt.clear();
      int t = i, num = 0;
      while (!vis[t]) {
        num++;
        tt.push_back(t);
        vis[t] = 1;
        t = a[t];
      }
      v[num].push_back(tt);
    }
  }
  for (int i = 1; i <= n; i++) {
    if (i % 2 == 0 && v[i].size() % 2 == 1) {
      printf("-1\n");
      return 0;
    }
  }
  for (int i = 1; i <= n; i++) {
    if (i % 2 == 1) {
      int num = v[i].size();
      for (int j = 0; j < num; j++) {
        tt.clear();
        int k, x, y;
        for (k = 0, x = 0, y = (i + 1) / 2; k < i / 2; k++, x++, y++) {
          tt.push_back(v[i][j][x]);
          tt.push_back(v[i][j][y]);
        }
        tt.push_back(v[i][j][x]);
        v[i][j] = tt;
      }
    } else {
      int num = v[i].size();
      for (int j = 0; j < num; j += 2) {
        tt.clear();
        for (int k = 0; k < i; k++) {
          tt.push_back(v[i][j][k]);
          tt.push_back(v[i][j + 1][k]);
        }
        v[i][j] = tt;
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    if (i % 2 == 1) {
      for (int j = 0; j < v[i].size(); j++) {
        for (int k = 0; k < i; k++) {
          a[v[i][j][k]] = v[i][j][(k + 1) % i];
        }
      }
    } else {
      for (int j = 0; j < v[i].size(); j += 2) {
        for (int k = 0; k < 2 * i; k++) {
          a[v[i][j][k]] = v[i][j][(k + 1) % (2 * i)];
        }
      }
    }
  }
  for (int i = 1; i <= n; i++) printf("%d ", a[i]);
  return 0;
}
