#include<cstdio>
#include<algorithm>

using namespace std;

const int N=1<<14;

short int a[N],fr[N];

int main()
{
	freopen("medie.in","r",stdin);
	freopen("medie.out","w",stdout);
	int n;
	scanf("%d",&n);
	for (int i=1;i<=n;i++)
	{
		scanf("%hd",&a[i]);
		fr[a[i]]++;
	}
	sort(a+1,a+n+1);
	int s=0;
	for (int j=1;j<n;j++)
		for (int k=j+1;k<=n;k++)
		{
			int x=a[j]+a[k];
			if (x%2==0)
			{
				x/=2;
				s+=fr[x];
				if (a[j]==x)
					s-=2;
			}
		}
	printf("%d",s);
	return 0;
}