N = int(input())
A = list(map(int, input().split()))

import sys
sys.setrecursionlimit(10**6)

from sortedcontainers import SortedList

now = SortedList()
G = [[-1, -1] for _ in range(N)]

now.add((A[0], 0))

def add(i, a):
    if A[a] < A[i]:
        if G[i][0] == -1:
            G[i][0] = a
        else:
            add(G[i][0], a)
    else:
        if G[i][1] == -1:
            G[i][1] = a
        else:
            add(G[i][1], a)

for i in range(1, N):
    j = now.bisect_left((A[i], i))
    if j == 0:
        j += 1
    add(now[j-1][1], i)
    now.add((A[i], i))

B = [0] * N
C = [0] * N
def dfs(i, p, d):
    B[i] = d
    for j in G[i]:
        if j != -1:
            C[i] += dfs(j, i, d+1)
    return C[i]+1

dfs(0, -1, 0)
print(*B)
print(*C)