#include <iostream>
#include <fstream>
#include <algorithm>
#include <map>
using namespace std;
const int nmax=2005;
typedef unsigned int uint;
map<int,int> m;
uint dp[nmax][nmax];
uint tot;
int v[nmax],t[nmax];
int i,j,n,norm;
int main()
{
    ifstream f("psir.in");
    ofstream g("psir.out");
    f>>n;
    for(i=1;i<=n;i++)
    {
        f>>v[i];
        t[i]=v[i];
    }
    sort(t+1,t+n+1);
    for(i=1;i<=n;i++)
    {
        if(t[i]>t[i-1]) norm++;
        m[t[i]]=norm;
    }
    for(i=1;i<=n;i++)
    {
        v[i]=m[v[i]];
        for(j=1;j<i;j++)
        {
            if(v[i]>v[j]) dp[i][v[j]]+=dp[j][norm]-dp[j][v[i]];
            if(v[i]<v[j]) dp[i][v[j]]+=dp[j][v[i]-1];
            dp[i][v[j]]++;
        }
        for(j=1;j<=norm;j++)
            dp[i][j]+=dp[i][j-1];
        tot+=dp[i][norm];
    }
    g<<tot;
    return 0;
}