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

# Precompute factorials up to (n-1)!
fact = [1] * n  # fact[i] = i!
for i in range(1, n):
    fact[i] = fact[i-1] * i

class FenwickTree:
    def __init__(self, size):
        self.n = size
        self.tree = [0] * (self.n + 2)  # 1-based indexing

    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

# Initialize Fenwick Tree with all elements present
ft = FenwickTree(n)
for i in range(1, n+1):
    ft.update(i, 1)

ans = 0
for i in range(n):
    current = p[i]
    # Number of elements less than current that are still available
    count = ft.query(current - 1)
    # Number of remaining elements after this step
    k = n - i - 1
    ans += count * fact[k]
    # Mark current element as used
    ft.update(current, -1)

print(ans + 1)