#include <bits/stdc++.h>

using namespace std;

ifstream fin ("pairs.in");
ofstream fout ("pairs.out");

const int NM = 1e6 + 5;

int n, f[NM];
bool c[NM];
vector<int>primes;

void precalc () {
    for (int i = 2; i * i < NM; i++) {
        if (c[i] == 0) {
            for (int j = 2 * i ; j < NM; j += i) {
                c[j] = 1;
            }
        }
    }
    for (int i = 2; i < NM; i++) {
        if (c[i] == 0) {
            primes.push_back(i);
        }
    }
}

int main() {
    precalc();

    fin >> n;
    long long answer = 0;
    for (int i = 1; i <= n; i++) {
        int x; fin >> x;
        vector<int>fact;
        for (int p : primes) {
            if (p * p > x) {
                fact.push_back(x);
                break;
            }
            if (x % p == 0) {
                fact.push_back(p);
                while (x % p == 0) {
                    x /= p;
                }
            }
        }
        int m = (int)fact.size();
        for (int bit = 0; bit < (1 << m); bit++) {
            int nr = 0, p = 1;
            for (int j = 0; j < m; j++) {
                if (bit & (1 << j)) {
                    nr++;
                    p *= fact[j];
                }
            }
            if (nr % 2 == 1) {
                answer -= f[p];
            } else {
                answer += f[p];
            }
            ++f[p];
        }

    }
    fout << 1ll * n * (n - 1) / 2 - answer;
}