#include <bits/stdc++.h>

using namespace std;

using ll = long long;

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

const int MAXV = 1e6;

bool ciur[1 + MAXV], f[1 + MAXV], in[1 + MAXV];
int cnt[1 + MAXV];

int main() {
  int n, x, mx = 0;

  fin >> n;
  for ( int i = 1; i <= n; ++i ) {
	fin >> x;
	mx = max(mx, x);
	in[x] = true;
  }
  ll res = (ll)n * (n - 1) / 2;
  for ( int d = 2; d <= mx; ++d ) {
	if ( !f[d] ) {
	  int k = 0;
	  cnt[d] += !ciur[d];
	  for ( int i = d + d; i <= mx; i += d ) {
		k += in[i];
		if ( !ciur[d] ) ++cnt[i];
		ciur[i] = 1;
	    f[i] |= (i % (d * d) == 0);
	  }
	  k += in[d];
	  res += (ll)k * (k - 1) / 2 * (cnt[d] % 2 ? -1 : 1);
	}
  }
  fout << res;
  fin.close();
  fout.close();
  return 0;
}