#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
vector <int> v;
vector <int>::iterator it;
int n,ind;
int cautare(int a,int b)
{
    int r=n,st=b+1,m,val=v[a]+v[b];
    it=upper_bound(v.begin(),v.end(),val);
    ind=(int)(it-v.begin());
    /*while(st<=r)
    {
        m=(st+r)/2;
        if (val<v[m])
        r=m-1;
        else st=m+1;
    }*/
    return ind-b-1;
}

int main()
{
    int i,j,k,s=0,x;
    fin>>n;
    for(i=1;i<=n;i++)
    {
        fin>>x;
        v.push_back(x);
    }
    sort(v.begin(),v.end());
    for(i=0;i<=n-3;i++)
        for(j=i+1;j<=n-2;j++)
    {

      s=s+cautare(i,j);

    }
    fout<<s;
    fin.close();
    fout.close();
    return 0;
}