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().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)
    
    digits = []
    for num in p:
        count = ft.query(num - 1)
        digits.append(count)
        ft.update(num, -1)
    
    s = 0
    for i in range(n):
        s = s * (n - i) + digits[i]
    
    print(s + 1)

if __name__ == "__main__":
    main()