class segtree():
  def __init__(self,init,func,ide):
    self.n=len(init)
    self.func=func
    self.ide=ide
    self.size=1<<(self.n-1).bit_length()
    self.tree=[self.ide for i in range(2*self.size)]
    for i in range(self.n):
      self.tree[self.size+i]=init[i]
    for i in range(self.size-1,0,-1):
      self.tree[i]=self.func(self.tree[2*i], self.tree[2*i|1])
  
  def update(self,k,x):
    k+=self.size
    self.tree[k]=x
    k>>=1
    while k:
      self.tree[k]=self.func(self.tree[2*k],self.tree[k*2|1])
      k>>=1
  
  def get(self,i):
    return self.tree[i+self.size]
  
  def query(self,l,r):
    l+=self.size
    r+=self.size
    l_res=self.ide
    r_res=self.ide
    while l<r:
      if l&1:
        l_res=self.func(l_res,self.tree[l])
        l+=1
      if r&1:
        r-=1
        r_res=self.func(self.tree[r],r_res)
      l>>=1
      r>>=1
    return self.func(l_res,r_res)
  
  def debug(self,s=10):
    print([self.get(i) for i in range(min(self.n,s))])

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

pow2=[1]
for i in range(10**5+10):
  pow2.append(pow2[-1]*2%mod)

n=int(input())
a=list(map(int,input().split()))

def calc(b):
  s=set()
  d=defaultdict(list)
  for i in range(n):
    s.add(b[i])
    d[b[i]].append(i)
  
  s=list(s)
  s.sort()

  segL=segtree([0]*n,lambda x,y:x+y,0)
  segR=segtree([0]*n,lambda x,y:x+y,0)
  
  ans=0
  for i in s:
    for j in d[i]:
      ans+=segL.query(0,j)*segR.query(j,n)
      ans%=mod
    
    for j in d[i]:
      segL.update(j,pow2[j])
      segR.update(j,pow2[n-1-j])
  
  return ans

ans1=calc(a)
ans2=calc([-i for i in a])

print((ans1+ans2)%mod)