#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];
	}
	
	{
		int ok = 1;
		for (int i = 0; i < N-1; i++) {
			if (!(A[i] < A[i+1])) {
				ok = 0;
				break;
			}
		}
		if (ok) {
			for (int i = 0; i < N; i++) {
				if (i > 0) cout << " ";
				cout << i;
			}
			cout << endl;
			for (int i = 0; i < N; i++) {
				if (i > 0) cout << " ";
				cout << (N - i - 1);
			}
			cout << endl;
			return 0;
		}
	}	
	
	{
		int ok = 1;
		for (int i = 0; i < N-1; i++) {
			if (!(A[i] > A[i+1])) {
				ok = 0;
				break;
			}
		}
		if (ok) {
			for (int i = 0; i < N; i++) {
				if (i > 0) cout << " ";
				cout << i;
			}
			cout << endl;
			for (int i = 0; i < N; i++) {
				if (i > 0) cout << " ";
				cout << (N - i - 1);
			}
			cout << endl;
			return 0;
		}
	}	
	
	vector<int> parent(N+1,0), left(N+1,0), right(N+1,0);
	
	for (int i = 1; i < N; i++) {
		int cur = A[0];
		while (1) {
			if (A[i] < cur) {
				if (left[cur] == 0) {
					left[cur] = A[i];
					parent[A[i]] = cur;
					break;
				} else {
					cur = left[cur];
				}
			} else if (cur < A[i]) {
				if (right[cur] == 0) {
					right[cur] = A[i];
					parent[A[i]] = cur;
					break;
				} else {
					cur = right[cur];
				}
			}
		}
	}
	
	vector<int> D(N+1,0);
	for (int i = 0; i < N; i++) {
		D[A[i]] = i;
	}
	
	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;
}