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

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

struct Node {
  int value;
  Node *left;
  Node *right;
};

int main() {
  int n;
  cin >> n;
  vector<int> a(n), ainv(n+1);
  rep(i, n) {
    cin >> a[i];
    ainv[a[i]] = i;
  }
  struct Node *tree = (struct Node*)malloc(sizeof(struct Node));
  tree->left = NULL;
  tree->right = NULL;
  tree->value = a[0];
  rep(i, n-1) {
    auto insert = [&](auto insert, struct Node *node, int x) {
      if (node == NULL) {
	struct Node *newNode = (struct Node*)malloc(sizeof(struct Node));
	newNode->value = x;
	newNode->left = NULL;
	newNode->right = NULL;
	return newNode;
      }
      if (x < node->value)
	node->left = insert(insert, node->left, x);
      else
	node->right = insert(insert, node->right, x);
      return node;
    };
    tree = insert(insert, tree, a[i+1]);
  }
  vector<int> b(n), c(n);
  auto printNode = [&](auto printNode, struct Node *node, int d) {
    if (node == NULL)
      return 0;
    int r = 0;
    r += printNode(printNode, node->right, d+1);
    b[ainv[node->value]] = d;
    r += printNode(printNode, node->left, d+1);
    c[ainv[node->value]] = r;
    return r + 1;
  };
  printNode(printNode, tree, 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;
}