#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

ifstream in("nrtri.in");
ofstream out("nrtri.out");

int BinarySearch(int low,int high,int k,int v[16001])
{
    int mid,result=0;
    for(; low<=high;)
    {
        mid=(low+high)/2;
        if(v[mid]==k)
        {
            result=mid;
            high=mid-1;
            cout<<"MID= "<<mid<<endl;
        }
        else if(k>v[mid])
        {
            low=mid+1;
        }
        else
        {
            high=mid-1;
            result=high;
        }
    }
    if(result!=0)
        return result;
    else
        return mid;
}

int main()
{
    int v[16001];
    int i,j,p,n;
    int x,y,z;
    int sum=0;
    in>>n;
    for(i=0;i<n;i++)
    {
        in>>v[i];
    }
    sort(v,v+n);
    for(i=0;i<n-2;i++)
    {
        for(j=i+1;j<n-1;j++)
        {
            x=BinarySearch(j+1,n-1,v[i]+v[j],v);
            if(v[i]+v[j]>=v[x] && x>j)
                {
                    sum=sum+x-j;
                }

        }
    }
    out<<sum;
}