#include <iostream>
#include <fstream>
using namespace std;
const int NMAX = 100000;
long long int v[NMAX + 1];
long long int vis[10 * NMAX + 1];
long long int n;
long long int x[NMAX];
long long int euler[NMAX + 1];
long long int answer;
long long int prime[NMAX + 1], primeSize;

void generateEuler() {
    // euler[i] = -1 => are divizori primi cu exponent > 1
    // euler[i] = v > 0 => nr de divizori primi ai lui i este v
    for (int i = 2; i <= NMAX; ++i) {
        if (euler[i] == 0) {
            for (int j = i; j <= NMAX; j = j + i) {
                if ( (j / i ) % i == 0 ) {
                    euler[j] = -1;
                } else if (euler[j] != -1) {
                    euler[j] ++;
                }
            }
        }
//        if (euler[i] != -1 && euler[i] != 0) {
//            if (euler[i] % 2 == 0 ) {
//                answer = answer - (x[i] * (x[i] - 1) / 2);
//            } else {
//                answer = answer + (x[i] * (x[i] - 1) / 2);
//            }
//        }
    }
    for (int i = 2; i <= NMAX; ++i) {
        if (euler[i] != 0 && euler[i] != -1 ) {
            long long int currentSum = 0;
            for (int j = i; j <= NMAX; j = j + i) {
                currentSum += vis[j];
            }
            if (euler[i] % 2 == 0) {
                answer = answer - currentSum;
            } else {
                answer = answer + currentSum;
            }
        }
    }

}

int main() {

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

    f >> n;
    for (int i = 0; i < n; ++i) {
        int x;
        f >> x;
        vis[x] = 1;
    }

    for (int i = 2; i <= NMAX; ++i) {
        for (int j = i; j <= NMAX; j += i) {
            if (vis[j] != 0) {
                x[i] ++;
            }
        }
    }
    generateEuler();
    //cout << euler[20];
    g << n * (n - 1) / 2 - answer;


    return 0;
}