#include <bits/stdc++.h>
using namespace std;
//*/
#include <atcoder/all>
using namespace atcoder;
//*/
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,a,b) for(int i=a;i<b;i++)
#define ALL(x) (x).begin(),(x).end()
#define dbgv(x); for(auto now : x) cout << now << " "; cout << endl;
//using P = pair<int,int>;
using ll = long long;
using ull = unsigned long long;
//*/
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<int> vint;
random_device rnd;
mt19937 rng(rnd());
using mint = modint998244353;

void solve(){
  int n; cin >> n;
  vint a(n); rep(i,n) cin >> a[i];
  vint p(n),q(n); rep(i,n) p[i] = i+1,q[i] = i+1;
  set<int> st;
  int tar = -1;
  rep(i,n){
    if(st.find(a[i]) == st.end()) st.insert(a[i]);
    else{
      tar = a[i];
      break;
    }
  }
  if(tar == -1){
    cout << -1 << endl;
    return;
  }
  int ii = -1,jj = -1;
  rep(i,n){
    if(a[i] == tar){
      if(ii == -1) ii = i;
      else if(jj == -1) jj = i;
    } 
  }
  swap(q[ii],q[jj]);
  dbgv(p);
  dbgv(q);
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int t = 1; //cin >> t;
  rep(dirc,t) solve();
}