#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

// long version
long long int GCD(long long int x, long long int y){
    if(x == 0 && y == 0) return 0;
    if(x>y){
        long long int swap = x;
        x = y;
        y = swap;
    }
    while(true){
        if(y%x==0){
            return x;
        }else{
            long long int amari = y%x;
            y = x;
            x = amari;
        }
    }
}

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

    int ans = 0;

    rep(i,n){
        srep(j,i+1,n){
            srep(k,j+1,n){
                if(GCD(GCD(a[i],a[j]),a[k])==1)ans++;
            }
        }
    }

    cout << ans << endl;
    return 0;
}