#include <fstream>
#include<algorithm>
using namespace std;
ifstream cin ("psir.in");
ofstream cout ("psir.out");
long long n,best[2010][2010],data[100010],sum,t,sol;
struct bla
{
    int o,v;
} date[100010];
bool sortare (bla q,bla w)
{
    return q.v<w.v;
}
void read ()
{
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>date[i].v,date[i].o=i,data[i]=date[i].v;
        sort(date+1,date+n+1,sortare);
}
void big (int ord,int value)
{
    int st=1,dr=n,mij=(st+dr)/2;
    while(st<=dr)
    {
        if(date[mij].v>value) dr=mij-1;
        else st=mij+1;
        mij=(st+dr)/2;
    }
    if(t==0)
    sum=sum+best[ord][n]-best[ord][dr];
    else if(t==1) { if(date[dr].v==value) dr--; sum=sum+best[ord][dr];}
}
void solve ()
{
    for(int i=2;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            if(date[j].o<i)
            {    sum=1;
                if(date[j].v<data[i]) t=0; else if(date[j].v>data[i]) t=1; else t=-1;
                big(date[j].o,data[i]);
                best[i][j]=best[i][j-1]+sum; sol+=sum;
            } else best[i][j]=best[i][j-1];
        }
    }
    cout<<sol;
}
int main()
{
    read();
    solve();
    cin.close();
    cout.close();
    return 0;
}