class FenwickTree:
    def __init__(self, size):
        self.n = size
        self.tree = [0] * (self.n + 2)  # Using 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

def main():
    import sys
    input = sys.stdin.read().split()
    n = int(input[0])
    p = list(map(int, input[1:n+1]))
    
    ft = FenwickTree(n)
    for i in range(1, n+1):
        ft.update(i, 1)
    
    # Precompute factorials where factorials[i] = (n-1 -i)!
    factorials = [1] * n
    for i in range(n-2, -1, -1):
        factorials[i] = factorials[i+1] * (n-1 - i)
    
    sum_rank = 0
    for i in range(n):
        x = p[i]
        c = ft.query(x - 1)
        sum_rank += c * factorials[i]
        ft.update(x, -1)
    
    print(sum_rank + 1)

if __name__ == "__main__":
    main()