#include<bits/stdc++.h>

using namespace std;
using ll=long long;
#define rep2(i, a, n) for(int i = (a); i < (n); i++)
#define rep(i, n) rep2(i,0,n)

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

int main(){
  cin.tie(nullptr);ios_base::sync_with_stdio(false);
  int n;cin>>n;
  int hoge[n];
  rep(i,n)cin>>hoge[i];
  int cnt=0;
  rep(i,n-2){
    rep2(j,i+1,n-1){
      rep2(k,j+1,n){
        if(gcd(hoge[i],gcd(hoge[j],hoge[k]))==1)cnt++;
      }
    }
  }
  cout<<cnt<<endl;
}