123

#include "bits/stdc++.h"
//speed coding handle

#define mp make_pair
#define cve(tpy) for (auto i : tpy) {for(auto j : i){cout << j << " ";  }cout << "\n";} ;
#define f first
#define s second
#define loop(i, x, n) for (int i = x; i < n; i++)
#define joop(x, n) for (ll j = x; j < n; j++)
#define lp(n) for (ll i = 0; i < n; i++)
#define err cout << "ERROR" << endl;
#define all(x) x.begin(), x.end()
#define pb push_back
#define sz(x) x.size()
#define rndm rng()

// types
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vvi vector<vector<int>>
#define vvll vector<vector<ll>>
typedef long long ll;
typedef long double ld;

// types of data
#define inf 1000000000
#define infll 1000000000000000000
#define INF ll(1e9)

#define md 998244353
#define mod 1000000009
//#define K 239017

#define DEBUG 1
using namespace std;
mt19937_64 rng(113113);
uniform_int_distribution<ll> drist;
//const int INF = numeric_limits<int>::max();

ll smd(ll n){
    ll sm = 0;
    for(ll i = 1; i < n; i++){
        if(n % i == 0){
            sm+=i;
        }
    }
    return sm;
}

int friends(ll a, ll b, ll c){
    int cnt = 0;
    cnt += (smd(a) == b and smd(b) == a) + (smd(a) == c and smd(c) == a) + (smd(c) == b and smd(b) == c);
    return cnt;
}
int friends(ll *ms, int n){
    int cnt = 0;
    loop(i, 0, n){
        loop(j, i+1, n){
            cnt += (smd(ms[i]) == ms[j] and smd(ms[j]) == ms[i]);
        }
    }
    return cnt;
}

int friends(ll ms[][2], int n, int m ){
    int cnt = 0;

    loop(i, 0, n){
        loop(j, 0, m){
            loop(ii, 0, n){

                loop(jj, 0, m){
                    if(ii == i and jj == j){
                        continue;
                    }
//                    cout << ms[ii][jj] << " ";

                    cnt += (smd(ms[i][j]) == ms[ii][jj] and smd(ms[ii][jj]) == ms[i][j]);
                }
//                cout << "\n";
            }
        }
    }
    return cnt / 2;
}

void solve(){
    cout << friends(220, 284, 220) <<"\n";
    int n;
    cin >> n;
    ll *a = new ll[n];
    loop(i, 0, n) cin >> a[i];
    cout << friends(a, n) << "\n";
    ll mt[3][2]={
            {1, 2},
            {220, 284},
            {284, 220}
    };
    cout << friends(mt, 3, 2);



//    vector<vector<int>> a(n, vector<int>(m));
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    solve();

    return 0;
}