#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("pairs.in");
ofstream out("pairs.out");
int n, v[100000]; int64_t rez;

int sol_30P(){
    for(int i = 0; i < n - 1; i++)
        for(int j = i + 1; j < n; j++)
            rez += (v[i] != v[j] && __gcd(v[i],v[j]) == 1);
    return rez;
}

int main(){
    in>>n; for(int i = 0; i < n; i++) in>>v[i];

    out<<sol_30P();

    return 0;
}