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

typedef long long ll;

const int N = 1e4 + 5;

int n, m;
int a[N], b[N], _left[N], _right[N];

struct SegmentTree {
	int l, r, sum;
} t[N * 4];

void discrete() {
	sort(a + 1, a + n + 1);
	for (int i = 1; i <= n; i++)
		if (i == 1 || a[i] != a[i - 1]) b[++m] = a[i];
}

int query(int x) {
	return lower_bound(b + 1, b + n + 1, x) - b;
}

void update(int p) {
	t[p].sum = t[p * 2].sum + t[p * 2 + 1].sum;
}

void build(int l, int r, int p) {
	t[p].l = l, t[p].r = r;
	if (l == r) {
		t[p].sum = 0;
		return;
	}
	int mid = (l + r) / 2;
	build(l, mid, p * 2);
	build(mid + 1, r, p * 2 + 1);
}

void change(int p, int x, int d) {
	if (t[p].l == t[p].r) {
		t[p].sum += d;
		return;
	}
	int mid = (t[p].l + t[p].r) / 2;
	if (x <= mid) change(p * 2, x, d);
	else change(p * 2 + 1, x, d);
	update(p);
}

int ask(int p, int l, int r) {
	if (l <= t[p].l && r >= t[p].r) return t[p].sum;
	int mid = (t[p].l + t[p].r) / 2;
	int val = 0;
	if (l <= mid) val += ask(p * 2, l, r);
	if (r > mid) val += ask(p * 2 + 1, l, r);
	return val;
}

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
	discrete();
	build(1, 1, n);
	for (int i = 1; i <= n; i++) a[i] = query(a[i]) + 1;
	for (int i = 1; i <= n; i++) {
		change(1, a[i], 1);
		if (a[i] != 1) _left[i] = ask(1, 1, a[i] - 1);
	}
	build(1, 1, n);
	for (int i = n; i >= 1; i--) {
		change(1, a[i], 1);
		_right[i] = ask(1, a[i] + 1, n);
	}
	ll ans = 0;
	for (int i = 1; i <= n; i++) ans += ll(_left[i] * _right[i]);
	printf("%lld\n", ans);
	return 0;
}