#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;

ifstream f("pairs.in");
ofstream g("pairs.out");

bool prime_intre_ele(int x, int y)
{
    int z = min(x, y);
    for(int i=2; i<=z/2; i++)
        if(x%i == 0 && y%i==0)
            return 0;
    if(x%z == 0 && y%z ==0)
        return 0;
    return 1;
}

int main()
{
    int n, x, cnt=0;
    vector <int> a;
    f>>n;
    for(int i=1; i<=n; i++)
    {
        f>>x;
        a.push_back(x);
    }
    for(int i=0; i<n-1; i++)
        for(int j=i+1; j<n; j++)
            if(prime_intre_ele(a[i], a[j])==1)
                cnt++;
    g<<cnt;
    return 0;
}