/*#include <fstream>

using namespace std;

int main()
{
    ifstream cin("nrtri.in");
    ofstream cout("nrtri.out");

    int n, a[100], p=0;
    cin>>n;
    for(int i=1; i<=n; i++)
        cin>>a[i];
    for(int i=1; i<=n; i++){
        for(int j=i+1; j<=n; j++){
            for(int k=j+1; k<= n; k++)
    if(a[i]+a[j]>=a[k] && a[k]+a[i]>=a[j] && a[j]+a[k] >=a[i])
            p++;

        }
    }
    cout<<p;

    return 0;
}*/

//‪#‎include‬ <iostream>
#include <fstream>
#include <algorithm>
const int maxn=805;
using namespace std;
ifstream cin("nrtri.in");
ofstream cout("nrtri.out");

int v[maxn];
int bin_sch(int x,int n)
{
int st=1;
int dr=n + 1;
while(dr-st>1)
{

int mij=(st+dr)/2;
if(v[mij]<=x)st=mij;
else if(v[mij]>x) dr=mij;


}
return st;
}
int main()
{
int n;
cin>>n;

for(int i=1;i<=n;i++)
cin>>v[i];

sort(v+1,v+n+1);
v[n + 1] = 100000000;
int nr=0;

for(int i=1;i<=n-2;i++)
{
for(int j=i+1;j<=n-1;j++)
{
int cnt=bin_sch(v[i]+v[j],n)-j;
nr=nr+cnt;
}
}
cout<<nr;
return 0;
}