#include <fstream>
#include <algorithm>

using namespace std;
int n,v[800],c;

int cautare_binara(int x,int y,int z)
{
    int st,dr,m;
    st=z+1;
    dr=n-1;
    while(st<=dr)
    {
        m=(st+dr)/2;
        if(v[x]+v[y]>v[m])
            st=m+1;
        else
            dr=m-1;
    }
    return dr-z;

}
int main()
{
    ifstream f("nrtri.in");
    ofstream g("nrtri.out");
    f>>n;
    for(unsigned short int i=0;i<n;i++)
        f>>v[i];
    sort(v,v+n);
    int i,j;
    for(i=0;i<n-2;i++)
        for(j=i+1;j<n-1;j++)
            c+=cautare_binara(v[i],v[j],j);
    g<<c;

    return 0;
}