#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <atcoder/modint>
#include <atcoder/fenwicktree>
using namespace std;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
#define rep(i,n) for(int i=0; i<(int)(n); i++)


const i64 INF = 1001001001001001001;
using modint = atcoder::static_modint<1000000007>;

vector<modint> pow2;

vector<modint> solve(vector<int> A){
    int N = A.size();
    atcoder::fenwick_tree<modint> rq(N);
    vector<int> I(N); rep(i,N) I[i] = i;
    sort(I.begin(), I.end(), [&](int l, int r) -> bool { return A[l] < A[r]; });
    int l = 0;
    vector<modint> ans(N);
    for(int r=0; r<N; r++){
        while(l < r && A[I[l]] < A[I[r]]){
            rq.add(I[l], pow2[I[l]]);
            l++;
        }
        ans[I[r]] = rq.sum(0, I[r]);
    }
    return ans;
}

int main(){
    int N; cin >> N;
    pow2.resize(N+1, 1);
    rep(i,N) pow2[i+1] = pow2[i] * 2;
    vector<int> A(N); rep(i,N) cin >> A[i];

    modint ans = 0;
    rep(t,2){
        auto q1 = solve(A);
        reverse(A.begin(), A.end());
        auto q2 = solve(A);
        reverse(A.begin(), A.end());
        rep(i,N) ans += q1[i] * q2[N-1-i];
        for(auto& a : A) a *= -1;
    }
    cout << ans.val() << '\n';
    return 0;
}


struct ios_do_not_sync{
    ios_do_not_sync(){
        std::ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
    }
} ios_do_not_sync_instance;