#include <cstdio>
#include <algorithm>
#include <vector>
FILE *f=fopen("ntri.in","r");
FILE *g=fopen("ntri.out","w");
using namespace std;
//vector <int>v;
int v[1000];
int nrsol,n;
void solve()
{
    int i,j,k;
    for(i=1;i<n-1;i++)
        for(j=i+1;j<n;j++)
            for(k=j+1;k<=n;k++)
                if(v[i]+v[j]>=v[k])
                    nrsol++;
                else
                    break ;
    fprintf(g,"%d\n",nrsol);
}
int main()
{
    int x;
    fscanf(f,"%d",&n);
    for(int i=1;i<=n;i++)
        {
            fscanf(f,"%d",&v[i]);
        }
    sort(v+1,v+n+1);
    solve();
    return 0;
}