P = 10 ** 9 + 7
#BIT plus ver
class BITplus:
    def __init__(self,N):
        self.N = N
        self.bit = [0] * (self.N+1)
    def add(self,i,x):
        while i <= self.N:
            self.bit[i] += x
            self.bit[i] %= P
            i += i & -i
    def fold(self,i):
        ans = 0
        while i > 0:
            ans += self.bit[i]
            ans %= P
            i -= i & -i
        return ans
    def lb(self,w):
        if w <= 0:return 0
        x = 0
        k = 1
        while k <= self.N:
            k <<= 1
        k >>= 1
        while k:
            if x + k <= self.N and self.bit[x+k] < w:
                w -= self.bit[x+k]
                x += k
            k >>= 1
        return x + 1

    #サイズ N の配列をいれる
    def build(self,seq):
        bit = self.bit
        N = self.N
        for i in range(N):
            bit[i+1] = seq[i]
        for i in range(1,N+1):
            if i + (i & -1) <= N:
                bit[i + (i & -i)] += bit[i]

N = int(input())
A = list(map(int,input().split()))
C = N + 5
beki = [1] * C
for i in range(1,C):
    beki[i] = beki[i-1] * 2 % P
rD = sorted(set(A))
D = {v:i + 1 for i,v in enumerate(rD)}
n = len(D)
migi = BITplus(n)
for i in range(N):
    migi.add(D[A[i]],beki[N - i - 1])
hidari = BITplus(n)
ans = 0
for i in range(N):
    a = A[i]
    migi.add(D[a],-beki[N - i - 1])
    tmp = hidari.fold(D[a] - 1)
    tmp2 = migi.fold(D[a] - 1)
    ans += tmp * tmp2 % P
    tmp = hidari.fold(n) - hidari.fold(D[a])
    tmp2 = migi.fold(n) - migi.fold(D[a])
    ans += tmp * tmp2 % P
    ans %= P
    hidari.add(D[a],beki[i])
print(ans)