#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  map<int, int> mp{{n + 10, 0}};
  VVI to(n + 1);
  VI ord{0};
  VI b(n + 1), par(n + 1);
  b[0] = -1, par[0] = -1;
  for (int i = 1; i <= n; i++) {
    int a;
    cin >> a;
    auto it = mp.upper_bound(a);
    int p = it->second;
    it->second = i;
    mp.emplace(a, i);
    b[i] = b[p] + 1;
    ord.emplace_back(i);
    par[i] = p;
  }
  VI c(n + 1);
  for (int u : ord | views::reverse) if (u) {
    c[par[u]] += c[u] + 1;
  }
  for (int i = 1; i <= n; i++) cout << b[i] << " \n"[i == n];
  for (int i = 1; i <= n; i++) cout << c[i] << " \n"[i == n];
}