// compile: make data
// run: time ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) _debug_print(#x, x);
#define Debug(x...) _debug_print_format(#x, x);
std::ifstream terminal("/dev/tty");
#define PP cerr<<"\033[1;30mpause...\e[0m",terminal.ignore();
#else
#define debug(x...)
#define Debug(x...)
#define PP
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define VI vector<int>
#define VII vector<vector<int>>
#define VIII vector<vector<vector<int>>>
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define FIND(a, x) ((find(a.begin(),a.end(),(x))!=a.end())?1:0)
#define cmin(x,...) x=min({(x), __VA_ARGS__})
#define cmax(x,...) x=max({(x), __VA_ARGS__})
#define INTMAX (int)(9223372036854775807)
#define INF (int)(1152921504606846976)
#define NaN (int)(0x8b88e1d0595d51d1)
#define double long double
#define int long long
#define uint unsigned long long
#define MAXN 200010

namespace mathlib {
    pair<vector<int>, vector<int>> mu_sieve(int N) {
        vector<int> mu(N+1), flg(N+1), p;
        mu[1] = 1;
        rep(i, 2, N+1) {
            if (!flg[i]) p.push_back(i), mu[i] = -1;
            for (int j = 0; j < sz(p) && i * p[j] <= N; ++j) {
                flg[i * p[j]] = 1;
                if (i % p[j] == 0) {
                    mu[i*p[j]] = 0;
                    break;
                }
                mu[i * p[j]] = -mu[i];
            }
        }
        return {mu, p};
    }
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    int n; cin >> n;
    vector<int> a(n);
    rep(i, 0, n) cin >> a[i];
    int N = *max_element(a.begin(), a.end());
    auto [mu, p] = mathlib::mu_sieve(N);

    vector<int> cnt(N+1, 0);
    // int total = 0;
    for (int x: a) {
        vector<pair<int, int>> v;
        for (int i = 0; i < sz(p) && p[i]*p[i] <= x && x > 1; ++i) {
            if (x % p[i] != 0) continue;
            v.push_back({p[i], 0});
            while (x % p[i] == 0) x /= p[i], ++v.back().second;
        }
        if (x > 1) v.push_back({x, 1});
        function<void(int, int)> dfs = [&](int k, int cur) {
            if (k >= sz(v)) {
                ++cnt[cur];
                return;
            }
            rep(i, 0, v[k].second+1) {
                dfs(k+1, cur * pow(v[k].first, i));
            }
        };
        dfs(0, 1);
    }
    auto g = [&](int k) -> int {
        return cnt[k] * (cnt[k] - 1) / 2;
    };
    int ans = 0;
    rep(d, 1, N+1) ans += mu[d] * g(d);
    cout << ans << endl;

    return 0;
}