#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

inline int rd() {
	int x = 0;
	bool f = 0;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) f |= (c == '-');
	for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
	return f ? -x : x;
}

#define fr first
#define sc second
#define mp make_pair
#define pb push_back

#define N 100007

bool del[N];

int a[N], res[N], op[N];

int A, B;

inline bool check(int n, int dlt) {
	int lim = sqrt(n);
	for (int i = 1; i <= lim; ++i)
		if (n % i == 0) 
			if (n - i - n / i == dlt) {A = i; B = n / i; return true;}
	return false;
}

int nodecnt, totlim;

struct node {int ls = 0, rs = 0, x = 0, tim = 0;} c[N];

map<multiset<int>, bool> vis;

pii lim[N];

bool dfs(int p, set<int> leaf, multiset<int> val) {
	if (vis[val]) return false;
	set<int> nxtleaf = leaf;
	multiset<int> nxtval = val;
	vis[val] = true;
	if (p == totlim + 1) return true;
	for (auto x : leaf) {
		if (check(c[x].x, lim[p].fr)) {
			nxtleaf.erase(x);
			nxtval.erase(nxtval.lower_bound(c[x].x));
			c[x].tim = lim[p].sc;
			c[c[x].ls = ++nodecnt].x = A;
			c[c[x].rs = ++nodecnt].x = B;
			nxtleaf.insert(nodecnt - 1); 
			nxtleaf.insert(nodecnt);
			nxtval.insert(A); 
			nxtval.insert(B);
			if (dfs(p + 1, nxtleaf, nxtval)) return true;
			nxtval.erase(nxtval.lower_bound(c[nodecnt].x));
			nxtval.erase(nxtval.lower_bound(c[nodecnt - 1].x));
			nxtleaf.erase(nodecnt);
			nxtleaf.erase(nodecnt - 1);
			c[x].tim = c[x].ls = c[x].rs = 0;
			nodecnt -= 2;
			nxtval.insert(c[x].x);
			nxtleaf.insert(x);
		} 
	}
	return false;
}

int id = 0;

void build(int u) {
	if (!c[u].ls) {res[++id] = c[u].x; return;}
	build(c[u].ls);
	op[c[u].tim] = id; 
	build(c[u].rs);
}

int main() {
	int n = rd();
	for (int i = 1; i <= n; ++i) a[i] = rd();
	int tot = n, cnt1 = 0;
	for (int i = n - 1; i; --i) 
		if (a[i] > a[i + 1]) {del[i] = true; ++cnt1; res[tot--] = 1; op[i] = tot;}
	for (int i = 1; i <= n; ++i) 
		if (i < n && a[i] > a[i + 1]) {a[i] -= cnt1; --cnt1;}
		else a[i] -= cnt1;
	c[nodecnt = 1].x = a[n];
	for (int i = n - 1; i; --i)   
		if (!del[i]) lim[++totlim] = make_pair(a[i + 1] - a[i], i);
	if (!dfs(1, set<int>{1}, multiset<int>{a[n]})) {puts("-1"); return 0;}
	build(1);
	for (int i = 1; i <= n; ++i) printf("%d ", res[i]); puts("");         
	for (int i = 1; i < n; ++i) printf("%d\n", op[i]);
	return 0;
}