#include<iostream>
#include<fstream>
using namespace std;
ifstream f("pairs.in");
ofstream g("pairs.out");
int prim(int n, int m)
{
    int r;
    while(m != 0)
    {
        int r = n % m;
        n = m;
        m = r;
    }
    return n;
}
int main()
{
    int n;
    f >> n;
    int a[n];
    for (int i = 0; i < n; i++)
        f >> a[i];
    int c=0;
    for (int i = 0; i < n-1; i++)
    {
        for (int j = i+1; j < n; j++)
            if (a[i] != a[j] && prim(a[i], a[j]) == 1)
                c++;
    }
    g<<c;
}