/<> 1517 (top down seg tree)

#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <unordered_map>
#include <numeric>
#include <iomanip>
using namespace std;
#define pii pair<long long, long long>
#define ll long long
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL)
const long long dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
const long long dl[2] = {1, -1};
const long long MOD = 1000000007;
const long long MAXN = 500005;

int N;
int loc[MAXN], arr[MAXN], assigned[MAXN];
int seg[MAXN * 4];
long long ans = 0;

void build_seg(int x, int s, int e){
    if(s == e){
        seg[x] = 0;
        return;
    }

    int mid = (s + e)/2;
    build_seg(x * 2, s, mid);
    build_seg(x * 2 + 1, mid + 1, e);
    seg[x] = seg[x * 2] + seg[x * 2 + 1];
}

int query(int x, int s, int e, int a, int b){
    if(e < a or s > b) return 0;
    if(a <= s and e <= b) return seg[x];

    int mid = (s + e) / 2;
    return query(x * 2, s, mid, a, b) + query(x * 2 + 1, mid + 1, e, a, b);
}

void update(int x, int s, int e, int idx, int val){
    if(idx < s or idx > e) return;
    if(s == e){
        seg[x] = val;
        return;
    }

    int mid = (s + e) / 2;
    update(x * 2, s, mid, idx, val);
    update(x * 2 + 1, mid + 1, e, idx, val);
    seg[x] = seg[x * 2] + seg[x * 2 + 1];

}

vector<int> tocomp;
vector<vector<int>> num(MAXN);

int main() {
    FAST;
    cin >> N;
    for(int i = 1; i <= N; i++){
        cin >> arr[i];
        tocomp.push_back(arr[i]);
    }
    sort(tocomp.begin(), tocomp.end());
    for(int i = 1; i <= N; i++){
        assigned[i] = (int) (std::lower_bound(tocomp.begin(), tocomp.end(), arr[i]) - tocomp.begin()) + 1;
        num[assigned[i]].push_back(i);
    }
    build_seg(1, 1, N);
    for(int k = 1; k <= N; k++){
        for(auto i : num[k]){
            int q = (i - 1) - query(1, 1, N, 1, i);
            // cout << i << " " << loc[i] << " " << q << "\n";
            ans += q;
            update(1, 1, N, i, 1);
        }
    }
    cout << ans << "\n";
}

/*
5
5 4 3 2 1
6
2 1 3
2 1 4
1 5 3
2 3 5
1 4 3
2 3 5
 */