#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<int>a(n);
	rep(i, n)cin >> a[i];
	map<int, vector<int>> mp;
	if (n >= 10) {
		vector<int>v(10);
		rep(i, 10)v[i] = i + 1;
		int tmpx = 0;
		rep2(i, 10, n) {
			tmpx ^= (i + 1) + a[i];
		}
		do {
			int x = 0;
			rep(i, 10) {
				x ^= a[i] + v[i];
			}
			if (mp.count(x)) {
				auto w = mp[x];
				rep(i, v.size())cout << v[i] << " ";
				rep2(i, v.size(), n)cout << i + 1 << " ";
				cout << endl;
				rep(i, w.size())cout << w[i] << " ";
				rep2(i, w.size(), n)cout << i + 1 << " ";
				cout << endl;
				return 0;
			}
			mp[x] = v;
		} while (next_permutation(v.begin(), v.end()));
	}
	else {
		vector<int>v(n);
		rep(i, n)v[i] = i + 1;
		do {
			int x = 0;
			rep(i, n) {
				x ^= a[i] + v[i];
			}
			if (mp.count(x)) {
				auto w = mp[x];
				rep(i, n)cout << v[i] << " ";
				cout << endl;
				rep(i, n)cout << w[i] << " ";
				cout << endl;
				return 0;
			}
			mp[x] = v;
		} while (next_permutation(v.begin(), v.end()));
	}
	cout << -1 << endl;
	return 0;
}