#include <bits/stdc++.h>
using namespace std;
vector<int> v[1000010];
int a[1000010], p[1000010];
bool mark[1000010] = {0};
int main() {
  int n, i, j, k;
  scanf("%d", &n);
  for (i = 1; i <= n; ++i) scanf("%d", &a[i]);
  for (i = 1; i <= n; ++i) {
    if (!mark[i]) {
      int c = 0, cur = i;
      while (!mark[cur]) {
        mark[cur] = 1;
        c++;
        cur = a[cur];
      }
      v[c].push_back(cur);
    }
  }
  bool f = 0;
  for (i = 2; i <= n; i += 2) {
    int sz = v[i].size();
    if (sz % 2) {
      f = 1;
      break;
    }
  }
  if (f) {
    printf("%d\n", -1);
    return 0;
  }
  for (i = 1; i <= n; i += 2) {
    for (j = 0; j < v[i].size(); ++j) {
      int cur = v[i][j], pos = 0;
      vector<int> arr(i);
      for (k = 0; k < i; ++k, pos = (pos + 2) % i) {
        arr[pos] = cur;
        cur = a[cur];
      }
      for (k = 0; k < i; ++k) p[arr[k]] = arr[(k + 1) % i];
    }
  }
  for (i = 2; i <= n; i += 2) {
    for (j = 0; j < v[i].size(); j += 2) {
      int cur1 = v[i][j], cur2 = v[i][j + 1];
      for (k = 0; k < i; ++k) {
        p[cur1] = cur2;
        p[cur2] = a[cur1];
        cur1 = a[cur1];
        cur2 = a[cur2];
      }
    }
  }
  for (i = 1; i <= n; ++i) printf("%d ", p[i]);
  printf("\n");
}
