#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000000 + 10;
int n, tot = 0, p[maxn], q[maxn], tmp[maxn];
vector<int> cy[maxn], num[maxn];
bool vis[maxn];
void printodd(vector<int> a) {
  int len = (int)a.size();
  int cur = 0;
  for (int i = 0; i < len; i++) {
    tmp[cur] = a[i];
    cur = (cur + 2) % len;
  }
  for (int i = 0; i < len; i++) q[tmp[i]] = tmp[(i + 1) % len];
}
void printeven(vector<int> a, vector<int> b) {
  int len = (int)a.size();
  int cur = 0;
  for (int i = 0; i < len; i++, cur += 2) tmp[cur] = a[i];
  cur = 1;
  for (int i = 0; i < len; i++, cur += 2) tmp[cur] = b[i];
  for (int i = 0; i < 2 * len; i++) q[tmp[i]] = tmp[(i + 1) % (2 * len)];
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &p[i]);
  memset(vis, 0, sizeof vis);
  for (int i = 1; i <= n; i++)
    if (!vis[i]) {
      ++tot;
      int x = i;
      while (!vis[x]) {
        cy[tot].push_back(x);
        vis[x] = true;
        x = p[x];
      }
      num[(int)cy[tot].size()].push_back(tot);
    }
  for (int i = 2; i <= n; i += 2)
    if ((int)num[i].size() % 2) {
      printf("-1\n");
      return 0;
    }
  for (int i = 1; i <= n; i++)
    if (i & 1) {
      for (int v : num[i]) printodd(cy[v]);
    } else {
      for (int j = 0; j < (int)num[i].size(); j += 2) {
        printeven(cy[num[i][j]], cy[num[i][j + 1]]);
      }
    }
  for (int i = 1; i <= n; i++) printf("%d ", q[i]);
  printf("\n");
  return 0;
}
