#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>

using namespace std;
using ll = long long;
using ull = unsigned long long;

const ll inf = 1e9 + 7;

long long gcd(long a,long b) { return (b==0 ?a:gcd(b,a%b));} 

int main(){	
	cin.tie(0);
	ios::sync_with_stdio(false);
	//cout << fixed << setprecison(15);
	int n;
	cin >> n;
	vector<ll> a(n);
	for(int i = 0; i < n; i++){
		cin >> a[i];
	}
	int ans = 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++){
				ll x = a[i];
				ll y = a[j];
				ll z = a[k];
				if(x < y)swap(x , y);
				ll cur = gcd(x , y);
				if(cur < z)swap(cur , z);
				if(gcd(cur , z) == 1)ans++;
			}
		}
	}
	cout << ans << endl;
	return 0;
}