#include <bits/stdc++.h>
#define sz(x) ((int)(x).size())
#define all(x) begin(x), end(x)
#ifdef memset0
#define log(...) fprintf(stderr, __VA_ARGS__)
#else
#define endl '\n'
#define log(...) (void(0))
#endif
using namespace std;
using ll = long long;
using lf = long double;
using ull = unsigned long long;

const int N = 2011;
bitset<N> g[N];
ll a[N];
ll gcd(ll a, ll b) {
  if (!b) return a;
  return gcd(b, a % b);
}
ll C2(ll n) { return n * (n - 1) / 2; }
int main() {
#ifdef memset0
  freopen("I.in", "r", stdin);
#endif
  cin.tie(0)->sync_with_stdio(0);
  int n;
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  for (int i = 1; i <= n; ++i)
    for (int j = i + 1; j <= n; ++j)
      if (gcd(a[i], a[j]) == 1) g[i][j] = g[j][i] = 1;
  ll ans = 0;
  for (int x = 1; x <= n; ++x)
    for (int y = x + 1; y <= n; ++y) {
      ll f = (g[x] & g[y]).count();
      ans += C2(f);
    }
  cout << (ans * 4) << '\n';
  return 0;
}