#include <bits/stdc++.h>
using namespace std;
const int N = 1e6;
int n;
int p[N], q[N];
bool visited[N];
vector<int> a[N + 1];
int sizecc(int u) {
  int k = 0;
  while (!visited[u]) {
    visited[u] = true;
    k++;
    u = p[u];
  }
  return k;
}
void sqrtPermEven(int u, int v, int k) {
  for (int t = 0; t < k; t++) {
    q[u] = v;
    q[v] = p[u];
    u = p[u], v = p[v];
  }
}
void sqrtPermOdd(int u, int k) {
  static int s[N];
  for (int i = 0; i < k; i += 2) {
    s[i] = u;
    u = p[u];
  }
  for (int i = 1; i < k; i += 2) {
    s[i] = u;
    u = p[u];
  }
  for (int i = 0; i < k; i++) q[s[i]] = s[(i + 1) % k];
}
int main() {
  scanf("%d", &n);
  for (int u = 0; u < n; u++) {
    scanf("%d", &p[u]);
    p[u]--;
  }
  for (int u = 0; u < n; u++)
    if (!visited[u]) a[sizecc(u)].push_back(u);
  bool possible = true;
  for (int k = 0; k <= n; k += 2) possible &= a[k].size() % 2 == 0;
  if (!possible)
    printf("-1");
  else {
    for (int k = 0; k <= n; k += 2) {
      while (!a[k].empty()) {
        int u = a[k].back();
        a[k].pop_back();
        int v = a[k].back();
        a[k].pop_back();
        sqrtPermEven(u, v, k);
      }
    }
    for (int k = 1; k <= n; k += 2)
      for (int u : a[k]) sqrtPermOdd(u, k);
    for (int u = 0; u < n; u++) printf("%d ", q[u] + 1);
    for (int u = 0; u < n; u++) assert(q[q[u]] == p[u]);
  }
}
