#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

struct FenwickTree {
	typedef int T;
	vector<T> v;
	void init(int n) { v.assign(n, 0); }
	void add(int i, T x) {
		for(; i < (int)v.size(); i |= i+1) v[i] += x;
	}
	T sum(int i) const {	//[0, i)
		T r = 0;
		for(-- i; i >= 0; i = (i & (i+1)) - 1) r += v[i];
		return r;
	}
	T sum(int left, int right) const {	//[left, right)
		return sum(right) - sum(left);
	}
};

int main() {
	int N;
	while(~scanf("%d", &N)) {
		vector<int> A(N);
		for(int i = 0; i < N; ++ i)
			scanf("%d", &A[i]);
		vector<int> values = A;
		sort(values.begin(), values.end());
		values.erase(unique(values.begin(), values.end()), values.end());
		for(vector<int>::iterator it = A.begin(); it != A.end(); ++ it)
			*it = lower_bound(values.begin(), values.end(), *it) - values.begin();
		int X = values.size();
		vi cnt(X, 0), sum(X+1, 0);
		rep(i, N)
			++ cnt[A[i]];
		rep(i, X)
			sum[i + 1] = sum[i] + cnt[i];
		FenwickTree ft;
		ft.init(X);
		vi curcnt(X, 0);
		vector<ll> cursum(X, 0);
		vi firstpos(X, -1);
		ll ans = 0;
		rep(i, N) {
			int a = A[i];
			int xL = ft.sum(a);
			int yL = i - xL - curcnt[a];
			ans += (ll)xL * (sum[a] - xL);
			ans += (ll)yL * (sum[X] - sum[a + 1] - yL);

			ans -= (ll)curcnt[a] * (i-1) - cursum[a];

			ft.add(a, 1);
			++ curcnt[a];
			cursum[a] += i;
		}
		rep(a, X) {
			int n = cnt[a];
			ans += (ll)n * (n-1) * (n-2) / 6;
		}
		printf("%lld\n", ans);
	}
	return 0;
}