#include<bits/stdc++.h>
using namespace std;
#define ll long long 
using db = double;
const ll inf = 1e8;
const int N = 1e6+10;
const ll p = 998244353;
const db esp = 1e-8;
#define rep(i,l,r) for(int i = l;i <= r;i++)
#define frep(i,l,r) for(int i = r;i >= l;i--)
ll aa[N];

void solve(bool _k){
	int n;
	cin>>n;
	ll ma = 0;
	rep(i,1,n)cin>>aa[i],ma = max(ma,aa[i]);
	ll ans = 0;
	rep(i,2,ma){
		rep(j,1,n){
			ll a0 = aa[j],a1 = a0*i,a2 = a1*i;
			if(a2 > ma)break;
			ll cnt0 = 0,cnt1 = 0,cnt2 = 0;
			rep(z,1,n){
				if(aa[z] == a0)cnt0++;
				if(aa[z] == a1)cnt1 += cnt0;
				if(aa[z] == a2)cnt2 += cnt1;
			}
			ans += cnt2;
		}
	}
	cout<<ans<<'\n';
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	int TT = 1;
//	cin>>TT;
	rep(i,1,TT)solve(i == TT);
	return 0;	
}