#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

void dfs(vector<vector<ll>> &graph, vector<ll> &dist, vector<ll> &dp,
         vector<bool> &isvisited, ll v) {
    isvisited[v] = true;
    ll ret = 1;
    for (ll x : graph[v]) {
        if (isvisited[x]) {
            continue;
        }
        dist[x] = dist[v] + 1;
        dfs(graph, dist, dp, isvisited, x);
        ret += dp[x];
    }
    dp[v] = ret;
}

int main() {
    ll N;
    cin >> N;
    vector<ll> A(N);
    for (ll i = 0; i < N; i++) {
        cin >> A[i];
        A[i]--;
    }
    // 木の構築
    vector graph(N, vector<ll>(0));
    vector<ll> left(N, -1);
    vector<ll> right(N, -1);
    set<ll> st;
    ll INF = 10000000023;
    st.insert(-INF);
    st.insert(INF);
    for (ll i = 0; i < N; i++) {
        if (i == 0) {
            st.insert(A[i]);
        } else {
            auto it = st.lower_bound(A[i]);
            ll right_val = *it;
            it--;
            ll left_val = *it;
            if (left_val == -INF) {
                left[right_val] = A[i];
                graph[right_val].push_back(A[i]);
                graph[A[i]].push_back(right_val);
            } else if (right_val == INF) {
                right[left_val] = A[i];
                graph[left_val].push_back(A[i]);
                graph[A[i]].push_back(left_val);
            } else {
                if (right[left_val] == -1) {
                    right[left_val] = A[i];
                    graph[left_val].push_back(A[i]);
                    graph[A[i]].push_back(left_val);
                } else {
                    left[right_val] = A[i];
                    graph[right_val].push_back(A[i]);
                    graph[A[i]].push_back(right_val);
                }
            }
            st.insert(A[i]);
        }
    }
    // A[0] を根として木 dp をしましょう
    debug(graph);
    vector<ll> dist(N, 0);
    vector<ll> dp(N, 0);
    vector<bool> isvisited(N, false);
    dfs(graph, dist, dp, isvisited, A[0]);
    for (ll i = 0; i < N; i++) {
        cout << dist[A[i]] << (i == N - 1 ? "" : " ");
    }
    cout << endl;
    for (ll i = 0; i < N; i++) {
        cout << dp[A[i]] - 1 << (i == N - 1 ? "" : " ");
    }
    cout << endl;
}