#include <stdio.h>

int N, v[100005], i, j;
long long cnt;

int gcd(int a, int b)
{
    if (!b) return a;
    return gcd(b, a % b);
}

int main(void)
{
    int i, j;
    FILE *fout = fopen("pairs.out", "w");

    freopen("pairs.in", "r", stdin);

    scanf("%d", &N);
    for (i = 1; i <= N; i++)
        scanf("%d", &v[i]);

    for (i = 1; i < N; i++)
        for (j = i+1; j <= N; j++)
            if (gcd(v[i], v[j]) == 1)
                cnt++;
    
    fprintf(fout, "%lld\n", cnt);

    fclose(fout);
        
    return 0;
}