/* -*- coding: utf-8 -*-
 *
 * 3134.cc:  No.3134 莠悟・謗｢邏｢譛ｨ - yukicoder
 */

#include<cstdio>
#include<set>
#include<algorithm>
#include<tuple>

using namespace std;

/* constant */

const int MAX_N = 200000;

enum { L, R };

/* typedef */

using tp4 = tuple<int,int,int,int>;
using stp4 = set<tp4>;

/* global variables */

int as[MAX_N];
int ps[MAX_N], nbrs[MAX_N][2];
int cis[MAX_N], ds[MAX_N], ss[MAX_N];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", as + i);

  for (int i = 0; i < n; i++) nbrs[i][0] = nbrs[i][1] = -1;

  stp4 q;
  q.insert({n, 1, -1, -1});

  for (int u = 0; u < n; u++) {
    auto sit = q.lower_bound({as[u], 0, -1, -1});
    auto [ar, al, prt, ci] = *sit;
    q.erase(sit);

    ps[u] = prt;
    if (prt >= 0) nbrs[prt][ci] = u;

    if (al < as[u]) q.insert({as[u] - 1, al, u, L});
    if (as[u] < ar) q.insert({ar, as[u] + 1, u, R});
  }

  for (int u = 0; u >= 0;) {
    auto &nbru = nbrs[u];
    int up = ps[u];

    if (cis[u] < 2) {
      int v = nbru[cis[u]++];
      if (v >= 0) {
	ds[v] = ds[u] + 1;
	u = v;
      }
    }
    else {
      if (up >= 0) ss[up] += ss[u] + 1;
      u = up;
    }
  }
  
  for (int i = 0; i < n; i++)
    printf("%d%c", ds[i], (i + 1 < n) ? ' ' : '\n');
  for (int i = 0; i < n; i++)
    printf("%d%c", ss[i], (i + 1 < n) ? ' ' : '\n');
  
  return 0;
}