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

int N, S, L[800];

int exista(int x, int i){
	int j, m;

	j=N-1;
	while (i<=j){
		m=(i+j)/2;
		if (L[m]>x)
			j=m-1;
		else
			i=m+1;
	}
	return N-j-1;
}

int main(){
	int i, j;

	ifstream fin ("nrtri.in");
	fin >> N;
	for (i=0; i<N; i++)
		fin >> L[i];
	fin.close();

	sort(L, L+N);

	for (i=0; i<N-2; i++)
		for (j=i+1; j<N-1; j++)
			S+=exista(L[i]+L[j], j+1);

	ofstream fout ("nrtri.out");
	fout << S << '\n';
	fout.close();

	return 0;
}