class FenwickTree:
    def __init__(self, size):
        self.n = size
        self.tree = [0] * (self.n + 1)  # 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
    data = input().split()
    
    n = int(data[0])
    p = list(map(int, data[1:n+1]))
    
    max_n = n
    fact = [1] * (max_n + 1)
    for i in range(1, max_n + 1):
        fact[i] = fact[i-1] * i
    
    ft = FenwickTree(n)
    for i in range(1, n+1):
        ft.update(i, 1)
    
    total = 0
    for i in range(n):
        current = p[i]
        if current > 1:
            k = ft.query(current - 1)
        else:
            k = 0
        rem = n - i - 1
        total += k * fact[rem]
        ft.update(current, -1)
    
    print(total + 1)

if __name__ == "__main__":
    main()