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

#include <atcoder/all>
using namespace atcoder;

using ll = long long;
using mint = modint998244353;

int main() {
  int N;
  cin >> N;
  vector<int> A(N), invA(N);
  for(int i = 0; i < N; i++) {
    cin >> A[i];
    A[i]--;
    invA[A[i]] = i;
  }
  vector<int> B(N), P(N);
  set<int> st;
  st.insert(A[0]);
  for(int i = 1; i < N; i++) {
    int x = A[i];
    auto it = st.lower_bound(x);
    if(it == st.begin()) P[x] = *it;
    else if(it == st.end()) P[x] = *prev(it);
    else if(B[*prev(it)] > B[*it]) P[x] = *prev(it);
    else P[x] = *it;
    B[x] = B[P[x]] + 1;
    st.insert(A[i]);
  }
  for(int i = 0; i < N; i++) {
    cout << B[A[i]] << " \n"[i == N - 1];
  }
  vector<int> C(N, 1);
  for(int i = N - 1; i > 0; i--) {
    int x = A[i];
    C[P[x]] += C[x];
  }
  for(int i = 0; i < N; i++) {
    cout << C[A[i]] - 1 << " \n"[i == N - 1];
  }
}