#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long n;
vector<long long> BIT(1000010);
void add(long long i, long long x) {
	while (i <= n) {
		BIT[i] += x;
		i += i & -i;
	}
}
long long csum(long long i) {
	long long count = 0;
	while (i > 0) {
		count += BIT[i];
		i -= i & -i;
	}
	return count;
}
long long sum(long long l, long long r) {
	return csum(r) - csum(l - 1);
}
vector<pair<int, int>> vec;
int a[1000010];
map<long long,long long> m;
long long l[1000010] = {}, r[1000010] = {}, co[1000010] = {}, co1[1000010] = {};
long long la[1000010], ra[1000010], li[1000010], ri[1000010];
long long z = 0;
int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		int a;
		cin >> a;
		vec.emplace_back(make_pair(a, i));
	}
	sort(vec.begin(), vec.end());
	int now = 1;
	for (int i = 0; i < n; i++) {
		if (i != 0 && vec[i].first != vec[i - 1].first)now++;
		a[vec[i].second] = now;
	}
	add(a[0], 1);
	for (int i = 1; i < n; i++) {
		la[i] = sum(a[i] + 1, n);
		li[i] = sum(1, a[i] - 1);
		add(a[i], 1);
	}
	for (int i = 1; i <= n; i++) {
		add(i, -BIT[i]);
	}
	add(a[n - 1], 1);
	for (int i = n-2; i >= 0; i--) {
		ra[i] = sum(a[i] + 1, n);
		ri[i] = sum(1, a[i] - 1);
		add(a[i], 1);
	}
	for (int i = 0; i < n; i++) {
		l[i + 1] = -1;
	}
	long long ans = 0;
	for (int i = 0; i < n; i++) {
		ans += li[i] * ri[i];
		ans += la[i] * ra[i];
	}
	for (int i = n - 1; i >= 0; i--) {
		m[a[i]]++;
		co1[i] = m[a[i]];
	}
	for (int i = 0; i < n; i++) {
		if (l[a[i]] != -1) {
			ans -= (i - l[a[i]] - 1) * co[a[i]] * co1[i];
		}
		co[a[i]]++;
		l[a[i]] = i;
	}
	cout << ans << endl;
}