#include <atcoder/fenwicktree>
#include <iostream>
#include <vector>
#include <tuple>

using namespace std;
using namespace atcoder;

int main() {

	int N;
	vector<int> A;

	cin >> N;
	
	int a1;
	
	cin >> a1;
	
	int id = 0;
	vector<tuple<int,int,int>> memo;
	fenwick_tree<int> fw(N+2);
	
	if (a1 > 1) {
		id++;
		memo.emplace_back(1, 1, a1-1);
		fw.add(1, id);
		fw.add(a1, -id);
	}
	if (a1 < N) {
		id++;
		memo.emplace_back(1, a1+1, N);
		fw.add(a1+1, id);
		fw.add(N+1, -id);
	}
	
	vector<int> B(N), C(N);
	
	C[0] = N - 1;
	
	for (int i = 1; i < N; i++) {
		int a;
		cin >> a;
		int tmp = fw.sum(0, a+1);
		int depth, lb, ub;
		tie(depth, lb, ub) = memo[tmp-1];
		B[i] = depth;
		C[i] = ub - lb;
		if (a > lb) {
			id++;
			memo.emplace_back(depth+1, lb, a-1);
			fw.add(lb, id-tmp);
			fw.add(a, -(id-tmp));
		}
		if (a < ub) {
			id++;
			memo.emplace_back(depth+1, a+1, ub);
			fw.add(a+1, id-tmp);
			fw.add(ub+1, -(id-tmp));
		}
	}

	for (int i = 0; i < N; i++) {
		if (i > 0) cout << " ";
		cout << B[i];
	}
	cout << endl;
	
	for (int i = 0; i < N; i++) {
		if (i > 0) cout << " ";
		cout << C[i];
	}
	cout << endl;
	
	return 0;
}