#include <iostream>
#include <vector>

using namespace std;

int main() {

	int N;
	vector<int> A;

	cin >> N;
	A.reserve(N);
	for (int i = 0; i < N; i++) {
		cin >> A[i];
	}
	
	vector<int> D(N+1,0), parent(N+1,0);
	
	for (int i = 0; i < N; i++) {
		D[A[i]] = i;
	}
	
	for (int i = 1; i < N; i++) {
		if (D[i] < D[i+1]) {
			parent[i+1] = i;
		} else {
			int j = i;
			while (1) {
				if (parent[j] == 0) {
					parent[j] = i+1;
					break;
				} else if (D[parent[j]] < D[i+1]) {
					if (parent[j] < i+1) {
						parent[i+1] = parent[j];
						parent[j] = i+1;
					} else {
						parent[i+1] = parent[j];
						parent[j] = i+1;
					}
					break;
				} else {
					j = parent[j];
				}
			}
		}
	}
	
	vector<int> B(N,0), C(N,0);

	for (int i = 1; i < N; i++) {
		B[i] = B[D[parent[A[i]]]] + 1;
	}
	
	for (int i = N-1; i > 0; i--) {
		C[D[parent[A[i]]]] += 1 + C[i];
	}
	
	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;
}