#include<bits/stdc++.h>
#include<atcoder/fenwicktree>
using namespace std;

int main(){
  using ll=long long;
  int n;
  cin>>n;
  vector<int> t(n);
  for (int i=0;i<n;i++) cin>>t[i];
  auto cmp=t;
  sort(cmp.begin(),cmp.end());
  cmp.erase(unique(cmp.begin(),cmp.end()),cmp.end());
  int k=cmp.size();
  atcoder::fenwick_tree<ll> cnt(k+1),fw(k+1);
  ll ans=0;
  for (int i=0;i<n;i++){
    t[i]=lower_bound(cmp.begin(),cmp.end(),t[i])-cmp.begin();
    ans+=cnt.sum(0,t[i])*cmp[t[i]]-fw.sum(0,t[i]);
    ans+=-cnt.sum(t[i]+1,k)*cmp[t[i]]+fw.sum(t[i]+1,k);
    cnt.add(t[i],1);
    fw.add(t[i],cmp[t[i]]);
  }
  cout<<ans<<endl;
}