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

void solve(){
    int n; cin >> n;
    vector<int>v(n);
    for(int i=1; i<=n; i++){
        cin >> v[i];
    }
    int cnt=0;
    vector<int>cpy=v;
    sort(cpy.begin(), cpy.end());
    if(v!=cpy){
        cout << 0 << endl;
        return;
    }
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++){
            if(v[i]<v[j]){
                if(((v[i]*v[j])%mod)%(v[i]+v[j])==0){
                    cnt++;
                }
            }
        }
    }
    cout << cnt << endl;
}

signed main(){
    ios_base::sync_with_stdio;
    cin.tie();
    cout.tie();
    //int t; cin >> t;
    //while(t--){
        solve();
    //}

}