#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, j, n) for (int i = (int)j; i < (int)n; i++)

struct Node {
  int p;
  int l;
  int r;
  Node (int p, int l, int r) : p(p), l(l), r(r) {}
};

int main() {
  int n;
  cin >> n;
  vector<struct Node> node(n, {-1, -1, -1});
  vector<int> a(n), ainv(n);
  rep(i, n) {
    cin >> a[i]; a[i]--;
    ainv[a[i]] = i;
  }
  rep(i, n) {
    if (ainv[i] < ainv[i+1]) {
      node[i+1].p = i;
    }
    else {
      int j = i;
      while (1) {
	if (node[j].p == -1) {
	  node[j].p = i+1;
	  break;
	} else if (ainv[node[j].p] < ainv[i+1]) {
	  node[i+1].p = node[j].p;
	  node[j].p = i+1;
	  break;
	} else {
	  j = node[j].p;
	}
      }
    }
  }
  node[a[0]].p = 0;
  rep(i, n) {
    if (node[i].p == 0)
      continue;
    if (i < node[i].p)
      node[node[i].p].l = i;
    else
      node[node[i].p].r = i;
  }
  vector<int> b(n), c(n);
  auto dfs = [&](auto dfs, int a, int d) {
    if (a == -1)
      return 0;
    int r = 0;
    b[ainv[a]] = d;
    r += dfs(dfs, node[a].l, d + 1);
    r += dfs(dfs, node[a].r, d + 1);
    c[ainv[a]] = r;
    return r + 1;
  };
  dfs(dfs, a[0], 0);
  rep(i, n) {
    cout << b[i];
    if (i < n-1) cout << " ";
    else         cout << endl;
  }
  rep(i, n) {
    cout << c[i];
    if (i < n-1) cout << " ";
    else         cout << endl;
  }
  return 0;
}