#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define fore(i,a) for(auto i:a)
#define fore1(i,a) for(auto &i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second

using namespace std;
using namespace atcoder;

using ll = long long;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return 1;} else {cout << "No" << endl; return 0;}}
#define dame { cout << "No" << endl; return 0;}
#define dame1 { cout << -1 << endl; return 0;}
#define test(x) cout << "test" << x << endl;
#define deb(x,y) cout << x << " " << y << endl;
#define deb3(x,y,z) cout << x << " " << y << " " << z << endl;
#define deb4(x,y,z,x2) cout << x << " " << y << " " << z << " " << x2 << endl;
#define out cout << ans << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define show(x) cerr<<#x<<" = "<<x<<endl;
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
using pii = pair<int,int>;
using tp = tuple<int ,int ,int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vb = vector<bool>;
using vpii = vector<pii>;
using vpli = vector<pli>;
using vpll = vector<pll>;
using vpil = vector<pil>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;
using vvpli = vector<vector<pli>>;
using vvpll = vector<vpll>;
using vvpil = vector<vpil>;
using mint = modint1000000007;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;

int main(){
    int n; cin>>n;
    vl a(n);
    map<int , int> mp;
    rep(i,n){
        cin>>a[i];
        mp[a[i]] = 0;
    }
    int m = 0;

    fore1(y , mp) y.se = m++; 

    fenwick_tree<mint> fwu(n),fwd(n),fwe(n);
    fenwick_tree<mint> cntu(n),cntd(n),cnte(n);

    rep(i,n){
        mint sumu = 0;
        mint sumd = 0;
        mint sume = 0;

        mint tmpu = 0;
        mint tmpd = 0;
        mint tmpe = 0;

        sumu += fwu.sum(mp[a[i]]+1 , n);
        sumu += fwd.sum(mp[a[i]]+1 , n);
        sumu += fwe.sum(mp[a[i]]+1 , n);

        sumd += fwu.sum(0,mp[a[i]]);
        sumd += fwd.sum(0,mp[a[i]]);
        sumd += fwe.sum(0,mp[a[i]]);

        sume += fwu.sum(mp[a[i]] , mp[a[i]]+1);
        sume += fwd.sum(mp[a[i]] , mp[a[i]]+1);
        sume += fwe.sum(mp[a[i]] , mp[a[i]]+1);

        tmpu += cntu.sum(mp[a[i]]+1 , n);
        tmpu += cntd.sum(mp[a[i]]+1 , n);
        tmpu += cnte.sum(mp[a[i]]+1 , n);

        tmpd += cntu.sum(0,mp[a[i]]);
        tmpd += cntd.sum(0,mp[a[i]]);
        tmpd += cnte.sum(0,mp[a[i]]);

        tmpe += cntu.sum(mp[a[i]] , mp[a[i]]+1);
        tmpe += cntd.sum(mp[a[i]] , mp[a[i]]+1);
        tmpe += cnte.sum(mp[a[i]] , mp[a[i]]+1);

        sumu += cntd.sum(mp[a[i]]+1 , n);
        sumd += cntu.sum(0 , mp[a[i]]);

        fwu.add(mp[a[i]] , sumu);
        fwd.add(mp[a[i]] , sumd);
        fwe.add(mp[a[i]] , sume);
        cntu.add(mp[a[i]] , tmpu);
        cntd.add(mp[a[i]] , tmpd);
        cnte.add(mp[a[i]] , tmpe+1);
    }

    mint ans = 0;

    ans += fwu.sum(0,n);
    ans += fwd.sum(0,n);
    ans += fwe.sum(0,n);

    cout << ans.val() << endl;

    return 0;
}