#include <fstream>
#include <algorithm>
using namespace std;
int n,v[8001];
int main()
{
	ifstream f("nrtri.in");
	ofstream g("nrtri.out");
	int i,j,q,K,x,aux;
	f>>n; K=0;
	for (i=1;i<=n;i++)
	{
		f>>x;
		v[i]=x;
	}
	sort (v+1,v+n+1);
	for (i=1;i<=n;i++)
		for (j=i+1;j<=n;j++)
			for (q=j+1;q<=n;q++)
				if (v[q]<=v[i]+v[j])
					K++;
	g<<K;
	f.close();g.close();return 0;
}