MOD = 10 ** 9 + 7

class Bit:
    def __init__(self, n):
        self.size = n
        self.n0 = 1 << (n.bit_length() - 1)
        self.tree = [0] * (n + 1)
    
    def range_sum(self, l, r):
        return self.sum(r - 1) - self.sum(l - 1)
        
    def sum(self, i):
        i += 1
        s = 0
        while i > 0:
            s += self.tree[i]
            s %= MOD
            i -= i & -i
        return s
        
    def get(self, i):
        return self.sum(i) - self.sum(i - 1)
 
    def add(self, i, x):
        i += 1
        while i <= self.size:
            self.tree[i] += x
            self.tree[i] %= MOD
            i += i & -i
         
    def lower_bound(self, x):
        pos = 0
        plus = self.n0
        while plus > 0:
            if pos + plus <= self.size and self.tree[pos + plus] < x:
                x -= self.tree[pos + plus]
                pos += plus
            plus //= 2
        return pos

n = int(input())
A = list(map(int, input().split()))
se = set(A)
dic = {d:i for i, d in enumerate(sorted(se))}
A = [dic[a] for a in A]
l = len(se)

bit = Bit(l)
small = [0] * n
big = [0] * n
plus = 1
for i, a in enumerate(A):
    small[i] = bit.sum(a - 1)
    big[i] = bit.range_sum(a + 1, l)
    bit.add(a, plus)
    plus *= 2
    plus %= MOD
bit = Bit(l)
plus = 1
for i in range(n - 1, -1, -1):
    a = A[i]
    small[i] *= bit.sum(a - 1)
    big[i] *= bit.range_sum(a + 1, l)
    bit.add(a, plus)
    plus *= 2
    plus %= MOD

ans = sum(big) + sum(small)
print(ans % MOD)