#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
template<class T> inline bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T&a,T b){if(a>b){a=b;return 1;}return 0;}
using ll = long long;

ll n;

ll inversion_number(vector<int> vec){
    vector<int> data(n+1);

    vector<int> tmp=vec;
    sort(tmp.begin(), tmp.end());
    tmp.erase(unique(tmp.begin(), tmp.end()), tmp.end());
    rep(i,vec.size()) vec[i]=lower_bound(tmp.begin(), tmp.end(), vec[i]) - tmp.begin();

    ll in=0;
    rep(i,n){
        vec[i]++;
        for(int j=vec[i];j>0;j-=(j&-j)) in-=data[j]; in+=i;
        for(int j=vec[i];j<(int)data.size();j+=(j&-j)) data[j]++;
    }
    return in;
}

int main(){
    cin.tie(0); ios::sync_with_stdio(false); 
    
    cin >> n;
    vector<int> m(n);
    rep(i,n) cin >> m[i];
    cout << inversion_number(m) << endl;
}