#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e6 + 3;
const long long MOD = 1e9 + 7;
int p[MAX], q[MAX], vis[MAX];
vector<vector<int>> cycles[MAX];
vector<int> v;
void dfs(int u) {
  vis[u] = 1;
  v.push_back(u);
  if (!vis[p[u]]) dfs(p[u]);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> p[i];
  for (int i = 1; i <= n; i++) {
    if (!vis[i]) {
      dfs(i);
      int len = v.size();
      cycles[len].push_back(v);
      v.clear();
    }
  }
  for (int i = 2; i <= n; i += 2) {
    int sz = cycles[i].size();
    if (sz % 2) return cout << "-1", 0;
    for (int j = 0; j < sz; j += 2) {
      for (int k = 0; k < i; k++) {
        int idx = cycles[i][j][k], val = cycles[i][j + 1][k];
        q[idx] = val;
        idx = cycles[i][j + 1][k], val = cycles[i][j][(k + 1) % i];
        q[idx] = val;
      }
    }
  }
  for (int i = 1; i <= n; i += 2) {
    int sz = cycles[i].size();
    for (int j = 0; j < sz; j++) {
      for (int k = 0; k < i; k++) {
        int idx = cycles[i][j][k], val = cycles[i][j][(k + (i + 1) / 2) % i];
        q[idx] = val;
      }
    }
  }
  for (int i = 1; i <= n; i++) cout << q[i] << " ";
}
