#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;

using pii = pair<int,int>;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define COUT(x) cout<<(x)<<"\n"
#define COUT15(x) cout << fixed << setprecision(15) << (x) << "\n";  

int gcd(int x,int y){
  if(y==0)return x;
  if(x<=y) swap(x,y);
  if(x%y==0) return y;
  else return(gcd(y,x%y));//最大公約数
}

int lcm(int x,int y){
  return (x/gcd(x,y))*y;//最小公倍数
}

int main(){
    int n;
    cin >> n;
    vector<int> a(n);
    REP(i,n){
        cin >> a[i];
    }
    int count = 0;
    for(int i=0;i<n-2;i++){
        for(int j=i+1;j<n-1;j++){
            for(int k=j+1;k<n;k++){
                if(gcd(a[k],gcd(a[i],a[j]))==1){
                    count++;
                }
            }
        }
    }
    COUT(count);
}