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

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

struct Node {
  int left;
  int right;
  Node(int left, int right) : left(left), right(right) {}
};

void insert(vector<struct Node> &node, int x, int y) {
  if (x == y)
    return;
  if (y < x) {
    if (node[x].left == -1) {
      node[x].left = y;
      return;
    } else {
      x = node[x].left;
      insert(node, x, y);
    }
  } else {
    if (node[x].right == -1) {
      node[x].right = y;
      return;
    } else {
      x = node[x].right;
      insert(node, x, y);
    }
  }
  return;
}

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