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

#include<cstdio>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_N = 200000;

/* typedef */

struct Node {
  int a, b, c;
  Node *lpt, *rpt;
  Node(): a(), b(), c(), lpt(), rpt() {}
  Node(int _a): a(_a), b(), c(), lpt(), rpt() {}
  Node(int _a, int _b, int _c): a(_a), b(_b), c(_c), lpt(), rpt() {}
};

/* global variables */

int as[MAX_N];
Node *es[MAX_N];

/* subroutines */

void addnode(Node *u, int i) {
  for (;;) {
    u->c++;
    if (as[i] < u->a) {
      if (u->lpt == nullptr) {
	u->lpt = es[i] = new Node(as[i], u->b + 1, 0);
	break;
      }
      u = u->lpt;
    }
    else {
      if (u->rpt == nullptr) {
	u->rpt = es[i] = new Node(as[i], u->b + 1, 0);
	break;
      }
      u = u->rpt;
    }
  }
}

/* main */

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

  es[0] = new Node(as[0]);
  for (int i = 1; i < n; i++) addnode(es[0], i);

  for (int i = 0; i < n; i++)
    printf("%d%c", es[i]->b, (i + 1 < n) ? ' ' : '\n');
  for (int i = 0; i < n; i++)
    printf("%d%c", es[i]->c, (i + 1 < n) ? ' ' : '\n');
  
  return 0;
}