MOD = 10**9 + 7

class FenwickTree:
    def __init__(self, size):
        self.n = size
        self.tree = [0] * (self.n + 1)
    
    def update(self, index, delta):
        while index <= self.n:
            self.tree[index] += delta
            index += index & -index
    
    def query(self, index):
        res = 0
        while index > 0:
            res += self.tree[index]
            index -= index & -index
        return res

def main():
    import sys
    input = sys.stdin.read().split()
    N = int(input[0])
    p = list(map(int, input[1:N+1]))
    
    # Precompute factorials modulo MOD
    fact = [1] * (N + 1)
    for i in range(1, N + 1):
        fact[i] = (fact[i-1] * i) % MOD
    
    fenwick = FenwickTree(N)
    for i in range(1, N+1):
        fenwick.update(i, 1)
    
    sum_rank = 0
    for i in range(N):
        x = p[i]
        cnt = fenwick.query(x-1)
        term = (cnt * fact[N - i - 1]) % MOD
        sum_rank = (sum_rank + term) % MOD
        fenwick.update(x, -1)
    
    result = (sum_rank + 1) % MOD
    print(result)

if __name__ == "__main__":
    main()