#include<fstream>
#include<algorithm>
using namespace std;
ifstream fi("psir.in");
ofstream fo("psir.out");
int n,i,j,A[2001],B[2001],Ind[2001];
unsigned int Dp[2001][2001],rez;

int bs(int st, int dr, int val)
{
    int mij;
    while(st<=dr)
    {
        mij=(st+dr)/2;
        if(val<=B[mij])
            dr=mij-1;
        else
            st=mij+1;
    }
    return st;
}

int main()
{
    fi>>n;
    for(i=1; i<=n; i++)
    {
        fi>>A[i];
        B[i]=A[i];
    }
    sort(B+1,B+n+1);
    for(i=1; i<=n; i++)
        Ind[i]=bs(1,n,A[i]);
    for(i=1; i<=n; i++)
    {
        for(j=1; j<i; j++)
        {
            if(Ind[i]<Ind[j])
                Dp[i][Ind[j]]=Dp[i][Ind[j]]+Dp[j][Ind[i]-1];
            if(Ind[i]>Ind[j])
                Dp[i][Ind[j]]=Dp[i][Ind[j]]+Dp[j][n]-Dp[j][Ind[i]];
            Dp[i][Ind[j]]++;
        }
        for(j=1; j<=n; j++)
            Dp[i][j]=Dp[i][j-1]+Dp[i][j];
        rez=rez+Dp[i][n];
    }
    fo<<rez<<"\n";
    fi.close();
    fo.close();
    return 0;
}