#include <iostream>
#include <vector>
#include <map>

using namespace std;

int main() {

	int N;
	vector<int> A;

	cin >> N;
	
	int id = 1;
	map<int,int> m;

	vector<int> B(N), C(N);
	
	C[0] = N - 1;
	
	for (int i = 0; i < N; i++) {
		int a;
		cin >> a;
		auto ub = m.upper_bound(a);
		auto lb = m.upper_bound(a);
		if (lb == m.begin()) {
			lb = m.end();
		} else if (m.size() > 0) {
			lb--;
		}
		if (lb == m.end()) {
			if (ub != m.end()) {
				B[i] = B[ub->second] + 1;
				C[i] = (ub->first - 1) - 1;
			}
		} else if (ub == m.end()) {
			B[i] = B[lb->second] + 1;
			C[i] = N - (lb->first + 1);
		} else {
			B[i] = max(B[lb->second], B[ub->second]) + 1;
			C[i] = (ub->first - 1) - (lb->first + 1);
		}
		m.emplace(a, 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;
}