#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<deque>

using namespace std;

int N,num[50001];
deque<int>deqb[50001],deqs[50001];
deque<int>::iterator it;
long long ans;

int main()
{
	freopen("queueb.in","r",stdin);
	freopen("queueb.out","w",stdout);
	scanf("%d",&N);
	for(int i=1;i<=N;i++)
		scanf("%d",&num[i]);
	for(int i=1;i<=N;i++)
		for(int j=i+1;j<=N;j++)
			if(num[j]>num[i])
				deqb[i].push_back(j);
			else if(num[j]<num[i])
				deqs[i].push_back(j);
	for(int i=1;i<=N;i++)
		for(it=deqb[i].begin();it!=deqb[i].end();it++)
			ans+=deqs[*it].size();
	printf("%lld\n",ans);
	return 0;
}