#include <bits/stdc++.h>
using namespace std ;
#define int long long
const int N = 2e5+10 ;
const int mod= 1e9+7 ;

void solve () {
  int n ;cin>>n ;
  int a[n] ;
  for (int i=0 ;i<n;i++) cin>>a[i] ;
  int cnt=0 ;
  for (int i=0 ;i<n-1;i++) {
    for (int j=i+1 ;j< n ;j++) {
        int p= a[i] *a[j] ;
        int sm= a[i]+ a[j] ;
        if (p %sm==0) cnt++ ;
    }
  }
  cout <<cnt <<"\n" ;
 ;
}
signed main () {
	//int t;cin>>t ;
	//while (t--)
        {
	 solve () ;
	}
}