MOD = 10**9 + 7

def main():
    import sys
    input = sys.stdin.read().split()
    n = int(input[0])
    p = list(map(int, input[1:n+1]))
    
    # Precompute factorial mod MOD
    fact_mod = [1] * (n + 1)
    for i in range(1, n + 1):
        fact_mod[i] = (fact_mod[i-1] * i) % MOD
    
    class FenwickTree:
        def __init__(self, size):
            self.n = size
            self.tree = [0] * (self.n + 1)
        
        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
    
    ft = FenwickTree(n)
    # Initialize Fenwick Tree with 1s
    for i in range(1, n+1):
        ft.update(i, 1)
    
    result = 0
    for i in range(n):
        current = p[i]
        remaining = n - i - 1
        count = ft.query(current - 1)
        result = (result + count * fact_mod[remaining]) % MOD
        ft.update(current, -1)
    
    result = (result + 1) % MOD
    print(result)

if __name__ == "__main__":
    main()