//#include<iostream>
#include<cstdio>
#include<algorithm>
#define NMax 100000
using namespace std;

const char IN[] = "pairs.in", OUT[] = "pairs.out";
/*function gcd(a, b)
    while b ≠ 0
       t := b
       b := a mod t
       a := t
    return a*/

int gcd(int a, int b) {
    int t;
    if(b > a) {
        t = b;
        b = a;
        a = t;
    }
    while(b > 0) {
        t = b;
        b = a%t;
        a = t;
    }
    return a;
}

int main() {
    int v[NMax], N, i, j, x = 0;
    freopen(IN, "r", stdin);
    scanf("%d", &N);
    for(i = 0; i < N; ++i)
        scanf("%d", &v[i]);
    fclose(stdin);

    for(i = 0; i < N; ++i)
        for(j = i+1; j < N; ++j)
            if(gcd(v[i], v[j]) == 1)
                ++x;

    freopen(OUT, "w", stdout);
    printf("%d", x);
    fclose(stdout);

    return 0;
}