#include<bits/stdc++.h>
using namespace std;
int main()
{
	 long long int n;
	 cin>>n;
	 long long int a[n], h1[n*n*n],h2[n*n*n],i,j,k,l=0,*r,*s,count=0;
	 for(i=0;i<n;i++)
	 {
	 	cin>>a[i];
	 }
	 for(i=0;i<n;i++)
	 {
	 	for(j=0;j<n;j++)
	 	{
	 		for(k=0;k<n;k++)
	 		{
	 			h1[l]=a[i]*a[j]+a[k];
	 			h2[l]=(a[i]+a[j])*a[k];
	 			if(a[k]==0)
	 			h2[l]==100000000000; // d=0 not allowed so fill such condition by number which will never come 
	 			l++;
			 }
		 }
	 }
	 sort(h1,h1+l);
	 sort(h2,h2+l);
	 for(i=0;i<l;i++)
	 {
	 	r=upper_bound(h2,h2+l,h1[i]);
	 	s=lower_bound(h2,h2+l,h1[i]);
	 	count+=(r-s);
 
	 }
	 cout<<count;
	 return(0);
}