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

# Precompute the largest factorial: (n-1)!
current_fact = 1
for i in range(1, n):
    current_fact *= i

# Fenwick Tree implementation
class FenwickTree:
    def __init__(self, size):
        self.n = size
        self.tree = [0] * (self.n + 2)  # Using n+2 to avoid issues with 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
ft = FenwickTree(n)
for i in range(1, n + 1):
    ft.update(i, 1)

ans = 0
for i in range(n):
    current = p[i]
    count = ft.query(current - 1)
    ans += count * current_fact

    # Update current_fact for the next step
    remaining = n - i - 1
    if remaining > 0:
        current_fact = current_fact // remaining
    else:
        current_fact = 1  # 0! is 1

    # Mark current as used
    ft.update(current, -1)

print(ans + 1)