import sys
input = sys.stdin.readline

F = [0] * 21
S = [0] * 21
visited = [False] * 21
N = int(input())
F[0] = 1

for i in range(1, N+1):
    F[i] = F[i-1] * i

inputList = list(map(int, input().split()))

if inputList[0] == 1:
    K = inputList[1]
    for i in range(1, N+1):
        cnt = 1
        for j in range(1, N+1):
            if visited[j]:
                continue
            if K <= cnt*F[N-i]:
                K -= (cnt-1) * F[N-i]
                S[i] = j
                visited[j] = True
                break
            cnt += 1
    for i in range(1, N+1):
        print(S[i], end=' ')
else:
    K = 1
    for i in range(1, N+1):
        cnt = 0
        for j in range(1, inputList[i]):
            if not visited[j]:
                cnt += 1
        K += cnt * F[N-i]
        visited[inputList[i]] = True
    print(K)

import sys
input = sys.stdin.readline
N, M, K = map(int, input().split())
D = [[0 for j in range(202)] for i in range(202)]

for i in range(0, 201):
    for j in range(0, i+1):
        if j==0 or j==i:
            D[i][j] = 1
        else:
            D[i][j] = D[i-1][j-1]+D[i-1][j]
            if D[i][j]>1000000000:
                D[i][j] = 1000000001

if D[N+M][M] < K:
    print(-1)
else:
    while not (N==0 and M==0):
        if D[N-1+M][M] >= K:
            print("a", end='')
            N -= 1
        else:
            print("z", end='')
            K -= D[N-1+M][M]
            M -= 1

N = int(input())
mod = 1000000000
D = [0]*1000001
D[1] = 0
D[2] = 1

for i in range(3, N+1):
    D[i] = (i-1)* (D[i-1] + D[i-2]) % mod
    
print(D[N])