#include //#include #pragma GCC optimize("Ofast") //#pragma GCC target("avx2") #pragma GCC optimize("unroll-loops") using namespace std; //#include //#include //namespace mp=boost::multiprecision; //#define mulint mp::cpp_int //#define mulfloat mp::cpp_dec_float_100 struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<=0;(i)--) #define flc(x) __builtin_popcountll(x) #define pint pair #define pdouble pair #define plint pair #define fi first #define se second #define all(x) x.begin(),x.end() //#define vec vector #define nep(x) next_permutation(all(x)) typedef long long lint; int dx[8]={1,1,0,-1,-1,-1,0,1}; int dy[8]={0,1,1,1,0,-1,-1,-1}; const int MAX_N=3e5+5; templatebool chmax(T &a,const T &b){if(abool chmin(T &a,const T &b){if(b bucket[MAX_N/1000]; //constexpr int MOD=1000000007; constexpr int MOD=998244353; #include using namespace atcoder; typedef __int128_t llint; lint op(lint a,lint b){ return a+b; } lint e(){ return 0; } lint calc(int N,vector A){ segtree seg_dist(200001),seg_cnt(200001); lint ret=0; rep(i,N){ lint plus_coef=seg_dist.prod(0,A[i])-seg_cnt.prod(0,A[i])*(N-1-i); ret+=plus_coef*A[i]; lint minus_coef=seg_dist.prod(A[i]+1,200001)-seg_cnt.prod(A[i]+1,200001)*(N-1-i); ret-=minus_coef*A[i]; seg_dist.set(A[i],seg_dist.get(A[i])+(N-1-i)); seg_cnt.set(A[i],seg_cnt.get(A[i])+1); } return ret; } int main(void){ int N; cin >> N; vector A(N); rep(i,N) cin >> A[i]; lint ans=0; ans+=calc(N,A); reverse(all(A)); ans+=calc(N,A); cout << ans << endl; }