#include<iostream>

using namespace std;
typedef long long int ll;

const int N = 5e5 + 10;
const int max_val = 2147483658;

ll t[4 * N], n, ans,cnt=0;
ll ls[4 * N], rs[4 * N];

void push_up(ll p)
{
	t[p] = t[ls[p]] + t[rs[p]];
}

void insert(ll &p, int l, int r,int k,ll val)
{
	if (!p)p = ++cnt;
	if (l == r)
	{
		t[p] += val;
		return;
	}
	ll mid = (l + r) >> 1;
	if (k <= mid)insert(ls[p], l, mid, k, val);
	else insert(rs[p], mid + 1, r, k, val);
	push_up(p);
}

ll rth(ll p, int l, int r, ll x)
{
	if (l == r)return 1;
	ll mid = (l + r) >> 1;
	if (x <= mid)return rth(ls[p], l, mid, x);
	return rth(rs[p], mid + 1, r, x)+t[ls[p]];
}

ll root, x;

int main()
{
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		cin >> x;
		insert(root, -max_val, max_val, x, 1);
		int step = t[1];
		ans += step - rth(root, -max_val, max_val, x);
	}
	cout << ans;
}