#include <cstdio>
#include <algorithm>

#define NMAX 100007

using namespace std;
int n, v[NMAX], sum;

int gcd(const int &a, const int &b)
{
    if(a == 0) return b;
    return gcd(b%a, a);
}

int main()
{
    freopen("pairs.in", "r", stdin);
    freopen("pairs.out", "w", stdout);
    scanf("%d", &n);
    for(int i = 1; i<= n; ++i) scanf("%d", &v[i]);
    sort(v+1, v+n+1);
    for(int i = 1; i<= n; ++i)
    {
        for(int j = i+1; j<= n; ++j)
        {
            if(v[j]%v[i] == 0) continue;
            sum+=(gcd(v[i], v[j]) == 1);
        }
    }
    printf("%d\n", sum);
    return 0;
}