#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("nrtri.in");
ofstream cout("nrtri.out");
int v[801];
int main()
{
    int n,triunghiuri=0;
    cin>>n;
    for(int i=0;i<n;i++)
        cin>>v[i];
    sort(v,v+n);
    int ok;
    for(int i=0;i<n-2;i++)
        for(int j=i+1;j<n-1;j++)
        {
            ok=0;
            int st=j+1,dr=n-1,mid,k=-1;
            int x=v[i]+v[j];
            while(st<=dr)
            {
                mid=st+(dr-st)/2;
                if(x>=v[mid])
                {
                    k=mid;
                    st=mid+1;
                }
                else dr=mid-1;
            }
            if(k!=-1)
                triunghiuri=triunghiuri+k-j;
        }
    cout<<triunghiuri;
    return 0;
}