#include<bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using mint=modint1000000007;
using ll=long long;
using pp=pair<int,int>;
#define sr string 
#define vc vector
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define pque priority_queue
#define bpc(a) __builtin_popcount(a)
int main(){
  int n;cin>>n;
  vc<int>v(n); rep(i,n)cin>>v[i];
  map<int,int>m;
  rep(i,n)m[v[i]]=0;
  int c=0;
  for(auto&[a,b]:m)b=c++;
  rep(i,n)v[i]=m[v[i]];
  fenwick_tree<mint>fw(c),fwx(c);
  mint ans=0;
  rep(i,n)fwx.add(v[i],mint(2).pow(n-i-1));
  rep(i,n){
    fwx.add(v[i],-mint(2).pow(n-i-1));
    ans+=fw.sum(0,v[i])*fwx.sum(0,v[i]);
    ans+=fw.sum(v[i]+1,c)*fwx.sum(v[i]+1,c);
    fw.add(v[i],mint(2).pow(i));
  }
  cout<<ans.val();
}