#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
//int op(int a, int b) { return a+ b; }
//int e() { return ; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<int>a(n);
	rep(i, n)cin >> a[i], a[i]--;
	vector<int>l(n, -1), r(n, -1);
	set<int>st = { a[0] };
	map<int, int>mp;
	mp[a[0]] = mp.size();
	rep2(i, 1, n) {
		st.insert(a[i]);
		auto ite = st.find(a[i]);
		int p = -1, q = -1;
		if (ite != st.begin()) {
			ite--;
			p = *ite;
		}
		ite = st.find(a[i]);
		ite++;
		if (ite != st.end()) {
			q = *ite;
		}
		if (p == -1) {
			l[mp[q]] = i;
		}
		else if (q == -1) {
			r[mp[p]] = i;
		}
		else if (r[mp[p]] == -1) {
			r[mp[p]] = i;
		}
		else {
			l[mp[q]] = i;
		}
		mp[a[i]] = mp.size();
	}
	vector to(n, vector<int>());
	rep(i, n) {
		if (l[i] != -1)to[i].push_back(l[i]);
		if (r[i] != -1)to[i].push_back(r[i]);
	}
	vector<int>b(n), c(n);
	auto dfs = [&](auto &&self, int v, int p = -1, int d = 0)->int {
		int ret = 0;
		b[v] = d;
		for (auto nv : to[v]) {
			ret += self(self, nv, v, d + 1);
		}
		c[v] = ret;
		return ret + 1;
	};
	dfs(dfs, 0);
	rep(i, n) {
		cout << b[i] << " ";
	}cout << endl;
	rep(i, n) {
		cout << c[i] << " ";
	}cout << endl;
	/*	rep(i, n) {
			cout << a[i] << " " << a[l[i]] << " " << a[r[i]] << endl;
		}*/
	return 0;
}