#include using namespace std; // #include // using namespace atcoder; typedef long long ll; typedef pair P; typedef pair PLL; typedef pair PP; typedef vector llVEC; typedef vector

PVEC; typedef priority_queue > PPQ; typedef priority_queue > llPQ; #define rep(i,a,n) for(ll i = a;i < n;i++) #define rrep(i,a,n) for(ll i = n-1; i >= a;i--) #define index_check(i,n) if(i > n-1 || i < 0) continue; #define LINF (ll)1e18 #define INF (int)1e9 #define fs first #define sc second template ll sz(vector &vec){ return (ll)vec.size(); } ll sz(string &s){ return (ll)s.size(); } ll gcd(ll a,ll b){ return ((!b) ?a :gcd(b, a%b)); } ll lcm(ll a,ll b){ return a / gcd(a,b) * b; } int main(){ ll n; cin >> n; ll a[n] = {}; rep(i,0,n) cin >> a[i]; ll cnt = 0; rep(i,0,n){ rep(j,i+1,n){ rep(k,j+1,n){ if(gcd(gcd(a[i],a[j]),a[k]) == 1) cnt++; } } } cout << cnt << endl; return 0; }