#include <fstream>
#include <algorithm>
using namespace std;
int n, v[802];
int main()
{
    int i, j, s, st, dr, mij, nr=0;
    ifstream in ("nrtri.in");
    ofstream out ("nrtri.out");
    in>>n;
    for(i=1;i<=n;i++)
        in>>v[i];
    sort (v+1, v+n+1);
    for(i=1;i<n-1;i++)
        for(j=i+1;j<n;j++)      ///2 3 4 7 9
        {
            s=v[i]+v[j];
            st=j;
            dr=n+1;
            while(dr-st!=1)
            {
                mij=(st+dr)/2;
                if(v[mij]<=s)
                    st=mij;
                else
                    dr=mij;
            }
            nr+=st-j; // tot intervalu de nr mai mici ca suma
        }
    out<<nr;
    in.close();
    out.close();
    return 0;
}