import sys
#input = sys.stdin.readline
input = sys.stdin.buffer.readline #文字列はダメ
#sys.setrecursionlimit(1000000)
#import bisect
#import itertools
#import random
#from heapq import heapify, heappop, heappush
#from collections import defaultdict 
#from collections import deque
#import copy
#import math
#from functools import lru_cache
#@lru_cache(maxsize=None)
MOD = pow(10,9) + 7
#MOD = 998244353
#dx = [1,0,-1,0]
#dy = [0,1,0,-1]
#dx8 = [1,1,0,-1,-1,-1,0,1]
#dy8 = [0,1,1,1,0,-1,-1,-1]

#和のセグ木にするときは以下の関数を定義する必要あり。
def segfunc(x,y):
  return x+y

class SegmentTree(object):
    def __init__(self, A, dot, unit):
        n = 1 << (len(A) - 1).bit_length()
        tree = [unit] * (2 * n)
        for i, v in enumerate(A):
            tree[i + n] = v
        for i in range(n - 1, 0, -1):
            tree[i] = dot(tree[i << 1], tree[i << 1 | 1])
        self._n = n
        self._tree = tree
        self._dot = dot
        self._unit = unit

    def __getitem__(self, i):
        return self._tree[i + self._n]

    def update(self, i, v):
        i += self._n
        self._tree[i] = v
        while i != 1:
            i >>= 1
            self._tree[i] = self._dot(self._tree[i << 1], self._tree[i << 1 | 1])

    def add(self, i, v):
        self.update(i, self[i] + v)

    def sum(self, l, r): #これで[l,r)から取り出す。
        l += self._n
        r += self._n
        l_val = r_val = self._unit
        while l < r:
            if l & 1:
                l_val = self._dot(l_val, self._tree[l])
                l += 1
            if r & 1:
                r -= 1
                r_val = self._dot(self._tree[r], r_val)
            l >>= 1
            r >>= 1
        return self._dot(l_val, r_val)


def compress(S):
    S = set(S); S = list(S)
    S.sort()
    dic_comp_ori = {}
    dic_ori_comp = {}
    for i,a in enumerate(S):
        dic_ori_comp[a] = i
        dic_comp_ori[i] = a
    return dic_comp_ori, dic_ori_comp 

MAX = 110000

two = [1]
for i in range(MAX):
    two.append(two[-1]*2%MOD)

def main():
    N = int(input())
    A = list(map(int,input().split()))
    dic_comp_ori, dic_ori_comp = compress(A)

    A = [dic_ori_comp[a] for a in A]

    # print(A)
    n = max(A) + 1 #Aの最大値

    left_tree = SegmentTree([0 for _ in range(n)], segfunc, 0)
    right_tree = SegmentTree([0 for _ in range(n)], segfunc, 0)

    for i,a in enumerate(A):
        val = two[N-1-i]
        # print("i",i,"val",val)
        right_tree.add(a,val)
    
    ans = 0

    for i,a in enumerate(A):
        # TL = []; TR = []
        # for j in range(n):
        #     TL.append(left_tree[j])
        #     TR.append(right_tree[j])
        # print(TL)
        # print(TR)

        left_small = left_tree.sum(0,a) #[0,a)
        right_small = right_tree.sum(0,a) #[a+1,MAX)
        left_large = left_tree.sum(a+1,n) #[0,a)
        right_large = right_tree.sum(a+1,n) #[a+1,MAX)

        # print("small",left_small,right_small)
        # print("large",left_large,right_large)
        temp = (left_small*right_small + left_large*right_large)%MOD
        ans += temp
        ans %= MOD
        # print(left,right,temp)
        left_val = two[i]
        right_val = two[N-1-i]
        left_tree.add(a,left_val)
        right_tree.add(a,-right_val)

    print(ans)


if __name__ == '__main__':
    main()