#include <fstream>
#include <vector>
#include <algorithm>

#define NMAX 1000001
#define DIM 100001

using namespace std;

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

int n;

bool vis[NMAX];

int ok[NMAX];

long long sol;

int main() {

	fin >> n;

	int maxim = 0;

	for (int i = 1; i <= n; i++) {

		int x;

		fin >> x;

		maxim = max(maxim, x);

		vis[x] = 1;

	}

	for (int i = 2; i <= maxim; i++) {


		if (ok[i]) {

			if (ok[i] == -1)
				continue;

			int nrc = 0;

			for (int j = i; j <= maxim; j += i) {

				nrc += vis[j];

			}

			if (ok[i] % 2 == 1)
				sol += 1LL * nrc * (nrc - 1) / 2;
			else
				sol -= 1LL * nrc * (nrc - 1) / 2;

			continue;

		}

		int nrc = 0;

		for (int j = i; j <= maxim; j += i) {

			nrc += vis[j];

		}

		for (int j = i + i; j <= maxim; j += i) {

			if (ok[j] != -1)
				ok[j]++;

			if (j % (i * i) == 0)
				ok[j] = -1;

		}

		sol += 1LL * nrc * (nrc - 1) / 2;
	
	}

	fout << 1LL * (n - 1) * n / 2 - sol << "\n";

	return 0;

}

//Trust me, I'm the Doctor!
//Miriam e tare!