class FenwickTree:
    def __init__(self, size):
        self.n = size
        self.tree = [0] * (self.n + 1)
    
    def update(self, idx, delta):
        while idx <= self.n:
            self.tree[idx] += delta
            idx += idx & -idx
    
    def query(self, idx):
        res = 0
        while idx > 0:
            res += self.tree[idx]
            idx -= idx & -idx
        return res

n = int(input())
p = list(map(int, input().split()))

# Precompute factorial
fact = [1] * (n + 1)
for i in range(1, n + 1):
    fact[i] = fact[i - 1] * i

ft = FenwickTree(n)
for i in range(1, n + 1):
    ft.update(i, 1)

sum_rank = 0
for i in range(n):
    current = p[i]
    cnt = ft.query(current - 1)
    sum_rank += cnt * fact[n - i - 1]
    ft.update(current, -1)

print(sum_rank + 1)