#include <fstream>
#include <cstdlib>
#include <algorithm>
using namespace std;
ifstream fin("queueb.in");
ofstream fout("queueb.out");
long long N,A[50001],Matrix[5000][5000],tot;


void Initialize()
{
int i,j;
	fin>>N;
	for(i=1;i<=N;i++)
		fin>>A[i];
	
}

void Solve()
{
long long i,j,s1=0,s2=0;
	for(i=1;i<=N;i++)
	{
		s1=0;s2=0;
		for(j=1;j<i;j++)
			if(A[i]>A[j])
				s1++;
		for(j=i+1;j<=N;j++)
			if(A[i]>A[j])
				s2++;
		tot+=s1*s2;
	}
	fout<<tot<<endl;
}

int main()
{
	Initialize();
	
	Solve();
	
	fin.close();
	fout.close();
	return 0;
}