#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,m,n) for(int i=m; i<n; ++i)
#define repl(i,m,n) for(ll i=m; i<n; ++i)

int gcd(int a, int b){
    return a % b ? gcd(b, a % b) : b;
}

int gcd3(int a, int b, int c){
    return gcd(gcd(a, b), c);
}

int main(){
    int n;
    cin >> n;
    vector<int> a(n);
    rep(i, 0, n) cin >> a[i];

    set<array<int, 3>> st;
    rep(i, 0, n) rep(j, i+1, n) rep(k, j+1, n){
        int A = a[i], B = a[j], C = a[k];
        if(gcd3(A, B, C) == 1){
            array<int, 3> arr = {A, B, C};
            sort(arr.begin(), arr.end());
            st.insert(arr);
        }
    }

    cout << st.size() << endl;
    return 0;
}