#include <bits/stdc++.h>
using namespace std;
const long double eps = 1e-9;
const long double PI = atan2((long double)0, (long double)-1);
const long long MOD = 1000000007;
const int INF = 1 << 30;
const int ARR_INF = 1 << 6;
const int MAXN = 1000005;
int n;
int p[MAXN];
int ans[MAXN];
bool vis[MAXN];
int evenpos[MAXN];
bool Sqrt_of_Permutation() {
  memset(vis, false, sizeof(vis));
  memset(evenpos, 0, sizeof(evenpos));
  for (int i = 1; i <= n; i++) {
    if (!vis[i]) {
      int cnt = 0;
      for (int j = i; !vis[j]; j = p[j]) {
        vis[j] = true;
        cnt++;
      }
      if (cnt % 2) {
        int l, r;
        l = r = i;
        for (int j = 0; j < (cnt + 1) / 2; j++) r = p[r];
        while (cnt > 1) {
          ans[l] = r;
          l = p[l];
          ans[r] = l;
          r = p[r];
          cnt -= 2;
        }
        ans[l] = i;
      } else {
        if (!evenpos[cnt])
          evenpos[cnt] = i;
        else {
          int l = i;
          int r = evenpos[cnt];
          evenpos[cnt] = 0;
          while (cnt > 1) {
            ans[l] = r;
            l = p[l];
            ans[r] = l;
            r = p[r];
            cnt--;
          }
          ans[l] = r;
          ans[r] = i;
        }
      }
    }
  }
  for (int i = 2; i <= n; i += 2) {
    if (evenpos[i]) return false;
  }
  return true;
}
int main() {
  while (scanf("%d", &n) != EOF) {
    for (int i = 1; i <= n; i++) scanf("%d", &p[i]);
    if (Sqrt_of_Permutation()) {
      for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
      printf("\n");
    } else
      printf("-1\n");
  }
  return 0;
}
