import sys def main(): n = int(sys.stdin.readline()) p = list(map(int, sys.stdin.readline().split())) # 预计算阶乘 fact = [1] * (n + 2) for i in range(1, n + 1): fact[i] = fact[i-1] * i # 定义BIT类 class BIT: def __init__(self, size): self.size = size self.tree = [0] * (size + 2) def update(self, idx, delta): while idx <= self.size: 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 # 初始化BIT bit = BIT(n) for i in range(1, n+1): bit.update(i, 1) ans = 0 for i in range(n): current = p[i] cnt = bit.query(current - 1) m = n - i - 1 ans += cnt * fact[m] bit.update(current, -1) print(ans + 1) if __name__ == "__main__": main()