#include<stdio.h>
#include<algorithm>
int b[100];
int main()
{
freopen("nrtri.in","r",stdin);
freopen("nrtri.out","w",stdout);
int c=0,a,b,i,j,n,m,u,p,x,y;
scanf("%d",&n);
for(i=1;i<=n;i++)
	scanf("%d",&b[i]);
std::sort(b+1,b+n+1);
for(i=1;i<=n;i++)
	for(j=i+1;j<=n;j++)
	{
		u=n;
		p=1;
		x=b[i]+b[j];
		y=b[j]-b[i];
		while(u>=p)
		{
			m=(u+p)/2;
			if(b[m]<=x&&y>=b[m])
				dr=m-1;
			else
				st=m+1;
		}
		a=m;
		u=n;
		p=1;
		while(u>=p)
		{
			m=(u+p)/2;
			if(b[m]<x)&&y>=b[m])
				dr=m-1;
			else
				st=m+1;
		}
		b=m;
		c=c+b-a;
	}
printf("%d",c);
return 0;
}