#include<bits/stdc++.h>
using namespace std;
#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP1(i, n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))
#define REP2(i, l, r) for (auto i = (l); (i) != (r); ++(i))
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define REP(i, l, r) rep(i, l, r+1)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
struct Edge {
  int to; ll w;
};
using Graph = vector<vector<int> >;
//using Graph = vector<vector<Edge> >;
const ll INF = 2e18;
//const int INF = 2e9;
template<class T> using vc = vector<T>;
template<class T> using vv = vector<vector<T> >;
template<class T> using vvv = vector<vector<vector<T> > >;
template<class T> using pq = priority_queue<T>;
template<class T> using pq_g = priority_queue<T, vc<T>, greater<T> >;
template<class T> istream& operator>>(istream& i, vc<T>& v) { rep(j, 0, v.size()) i>>v[j]; return i; }
template<class T> ostream& operator<<(ostream& o, vc<T>& v) { rep(j, 0, v.size()) o<<v[j]<<" "; return o; }
template<class T> bool chmin(T& a, T b) {
  if(a > b) {
      a = b;
      return true;
  }
  return false;
}
template<class T> bool chmax(T& a, T b) {
  if(a < b) {
      a = b;
      return true;
  }
  return false;
}

struct Node {
  int pos, i, val;
  Node *left, *right;
};

void add(Node& node, int i, int n, int p = 0) {
  int cur = node.val;
  if(n < cur) {
    if(node.left == nullptr) {
      node.left = new Node {p+1, i, n, nullptr, nullptr};
    }
    else add(*node.left, i, n, p+1);
  }
  if(n > cur) {
    if(node.right == nullptr) node.right = new Node {p+1, i, n, nullptr, nullptr};
    else add(*node.right, i, n, p+1);
  }
}
void print(Node& node) {
  cout << "(" << node.pos << " " << node.val << " ";
  if(node.left != nullptr) {cout << "l"; print(*node.left);}
  if(node.right != nullptr) {cout << "r"; print(*node.right);}
  cout << ")";
}
vc<P> ans;
int rec(Node& node) {
  int res = 0;
  if(node.left != nullptr) res += rec(*node.left);
  if(node.right!= nullptr) res += rec(*node.right);
  ans[node.i] = P(node.pos, res);
  return res+1;
}
int main() {
  // 高速化
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  // 小数点の出力桁数を指定
  cout << fixed << setprecision(10);
  // メイン
  int N;
  cin >> N;
  vc<int> A(N);
  cin >> A;

  Node node = {0, 0, A[0], nullptr, nullptr};
  rep(i, 1, N) {
    add(node, i, A[i]);
  }
  //print(node); cout << endl;
  ans.assign(N, P(0, 0));
  rec(node);
  rep(i, 0, N) cout << ans[i].first << " ";
  cout << endl;
  rep(i, 0, N) cout << ans[i].second << " ";
  cout << endl;


  return 0;
}