#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=0){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> bool inside(T l,T x,T r){return l<=x&&x<r;}

#include <atcoder/modint>
using mint = atcoder::modint998244353;
#include <atcoder/segtree>

ll op(ll a, ll b){
    return a + b;
}
ll e(){
    return 0;
}

void solve();
// CYAN / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N;
    cin >> N;
    vector<ll> A(N);
    rep(i, 0, N) cin >> A[i];
    vector<int> order(N);
    rep(i, 0, N) order[i] = i;
    sort(all(order), [&](int l, int r){
        return A[l] < A[r];
    });
    atcoder::segtree<ll, op, e> seg_count(N), seg_large(N), seg_small(N);
    ll ans = 0;
    rep(i, 0, N) ans += A[i] * (ll)(i);
    ans *= (N - 2) * 2;
    ll tmp1 = 0, tmp2 = 0;
    rep(i, 0, N){
        tmp1 += i;
        tmp2 += A[i];
    }
    // cout << ans << endl;
    ans += tmp1 * tmp2 * 2ll;
    ll ans2 = 0;
    rep(i, 0, N){
        seg_large.set(i, A[i]);
    }
    for (auto ind : order){
        ans2 += (ll)(ind) * (seg_count.prod(0, ind) * A[ind] + seg_large.prod(0, ind));
        ans2 += (ll)(ind) * (seg_small.prod(ind + 1, N) + ((ll)(N - ind - 1) - seg_count.prod(ind + 1, N)) * A[ind]);
        //cout << ans << " " << ans2 << endl;
        seg_count.set(ind, 1);
        seg_large.set(ind, 0);
        seg_small.set(ind, A[ind]);
    }
    cout << ans - (ans - ans2 * 2ll) * 2ll << "\n";
}