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

int op(int lhs, int rhs){return max(lhs, rhs);}
constexpr int e(){return -2;}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<int> a(n), pos(n + 1);
    for(int i = 0; i < n; i++){
        cin >> a[i];
        pos[a[i]] = i;
    }
    vector<pair<int,int>> g(n + 1);
    atcoder::segtree<int, op, e> seg(n + 2);
    seg.set(0, -1), seg.set(n + 1, -1);
    seg.set(a[0], 0);
    for(int i = 1; i < n; i++){
        int r = seg.max_right(a[i], [&](int v){return v < -1;});
        int l = seg.min_left(a[i], [&](int v){return v < -1;}) - 1;
        if(seg.get(l) > seg.get(r)) g[l].second = a[i];
        else g[r].first = a[i];
        seg.set(a[i], i);
    }
    vector<int> b(n), c(n);
    auto dfs = [&](auto dfs, int v) -> int {
        int sz = 0;
        auto [l, r] = g[v];
        if(l) b[pos[l]] = b[pos[v]] + 1, sz += dfs(dfs, l);
        if(r) b[pos[r]] = b[pos[v]] + 1, sz += dfs(dfs, r);
        c[pos[v]] = sz;
        return sz + 1;
    };
    dfs(dfs, a[0]);
    for(int i = 0; i < n; i++) cout << b[i] << (i + 1 == n ? '\n' : ' ');
    for(int i = 0; i < n; i++) cout << c[i] << (i + 1 == n ? '\n' : ' ');
}