from collections import defaultdict
mod = 10 ** 9 + 7


class FenwickTree(object):
    def __init__(self, n):
        self.n = n
        self.log = n.bit_length()
        self.data = [0] * n

    def __sum(self, r):
        s = 0
        while r > 0:
            s += self.data[r - 1]
            s %= mod
            r -= r & -r
        return s

    def add(self, p, x):
        """ a[p] += xを行う"""
        p += 1
        while p <= self.n:
            self.data[p - 1] += x
            self.data[p - 1] %= mod
            p += p & -p

    def sum(self, l, r):
        """a[l] + a[l+1] + .. + a[r-1]を返す"""
        return self.__sum(r) - self.__sum(l)

    def lower_bound(self, x):
        """a[0] + a[1] + .. a[i] >= x となる最小のiを返す"""
        if x <= 0:
            return -1
        i = 0
        k = 1 << self.log
        while k:
            if i + k <= self.n and self.data[i + k - 1] < x:
                x -= self.data[i + k - 1]
                i += k
            k >>= 1
        return i

    def __repr__(self):
        res = [self.sum(i, i+1) for i in range(self.n)]
        return " ".join(map(str, res))


N = int(input())
A = list(map(int, input().split()))
B = sorted(set(A))

d = defaultdict(list)
for i, a in enumerate(A):
    d[a].append(i)

two = [1] * N
for i in range(1, N):
    two[i] = two[i-1] * 2 % mod
rev = two[:][::-1]


ans = 0

L = FenwickTree(N)
R = FenwickTree(N)
for a in B:
    for i in d[a]:
        ans += L.sum(0, i) * R.sum(i, N)
        ans %= mod
    for i in d[a]:
        L.add(i, two[i])
        R.add(i, rev[i])

L = FenwickTree(N)
R = FenwickTree(N)
for a in B[::-1]:
    for i in d[a]:
        ans += L.sum(0, i) * R.sum(i, N)
        ans %= mod
    for i in d[a]:
        L.add(i, two[i])
        R.add(i, rev[i])

print(ans)