#include <fstream>
#include <algorithm>

using namespace std;

int v[1000001],n;

ifstream fin("nrtri.in");
ofstream fout("nrtri.out");

int cbdr(int x)
{
    int st=0,dr=n-1,last=0;
    while(st<=dr)
    {
    int mid=(st+dr)/2;
    if(v[mid]<=x)
    {
        last=mid;
        st=mid+1;
    }
    else
        dr=mid-1;
    }
    return last;
}

int main(){
    fin>>n;
    for(int i=1;i<=n;i++)
        fin>>v[i];
    int s=0;
    sort(v+1,v+n+1);
    for(int i=1;i<n;i++)
        for(int e=i+1;e<=n;e++)
            s+=cbdr(v[e])-cbdr(v[i]-1);
    fout<<s/3;
}