#include <fstream>
#include <algorithm>

using namespace std;

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

int v[801],s[320001],S,n,t,i,j,diff;

//Pentru ca segmentele de lungimi a,b,c sa formeze un triunghi:  med(a,b,c) + min(a,b,c) >= max(a,b,c)

int bynary_search (int  lo, int hi, int x)
{
    if (hi-lo<=1)
        return t-lo;
    int mid=(lo+hi)/2;
    if (x<=s[mid]) return bynary_search (lo,mid,x);
    else return bynary_search (mid,hi,x);
}

int main()
{
    fin>>n;
    for (i=1; i<=n; i++) fin>>v[i];

    for (i=1; i<=n-1; i++)
        for (j=i+1; j<=n; j++)
        s[++t]=v[i]+v[j];

    sort (s+1,s+t+1);
    sort (v+1,v+n+1);

    for  (i=n; i>=1; i--)
    {
         diff += i-1;
         S = S + (bynary_search (0,t+1,v[i]) - diff);   //invariant left < x <= right pentru a gasi primul x din sir
    }
    fout<<S;
}