#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;
};

struct Node* 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(node->left, x);
  else
    node->right = insert(node->right, x);
  return node;
}

#define N 200000
int a[N], ainv[N+1], b[N], c[N];

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