#include <bits/stdc++.h>
using namespace std;
int static const N = 2000010;
struct kr {
  int poc, d;
  kr() { d = 0; }
};
bool cmp(kr a, kr b) { return (a.d < b.d); }
int p[N], sl[N], n, q[N], w, tt[N];
bool used[N], re[N];
kr a[N];
int valja() {
  int br = 1;
  for (int i = 1; i <= w; i++) {
    if (a[i - 1].d == a[i].d)
      br++;
    else {
      if (a[i - 1].d % 2 == 0 && br % 2 != 0) return 0;
      br = 1;
    }
  }
  for (int i = 0; i < w; i++) {
    if (a[i].d % 2 == 0) {
      int r = a[i].poc, t = a[i + 1].poc;
      for (int j = 0; j < a[i].d; j++) {
        q[r] = t;
        q[t] = sl[r];
        r = sl[r];
        t = sl[t];
      }
      i++;
    } else {
      int r = a[i].poc, korak = (a[i].d + 1) / 2, poz = 0;
      for (int j = 0; j < a[i].d; j++) {
        tt[j] = r;
        r = sl[r];
      }
      for (int j = 0; j < a[i].d; j++) {
        q[tt[poz]] = tt[(poz + korak) % a[i].d];
        poz = (poz + korak) % a[i].d;
      }
    }
  }
  return 1;
}
int main() {
  scanf("%i", &n);
  for (int i = 1; i <= n; i++) scanf("%i", &p[i]);
  for (int i = 1; i <= n; i++) {
    if (!used[i]) {
      a[w].poc = i;
      int k = i;
      while (!used[k]) {
        a[w].d++;
        sl[k] = p[k];
        used[k] = 1;
        k = p[k];
      }
      w++;
    }
  }
  sort(a, a + w, cmp);
  if (!valja())
    printf("-1\n");
  else {
    for (int i = 1; i <= n; i++) printf("%i ", q[i]);
    printf("\n");
  }
  return 0;
}
