#include <bits/stdc++.h>
using namespace std;
ifstream f("pairs.in");
ofstream g("pairs.out");

const int Max = 1e6 + 1;
void nos()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}
int n;
vector < int > multime;
int maxx;
void read()
{
    f>>n;
    int i;
    for(i=1;i<=n;i++)
    {
        int x;
        f>>x;
        maxx = max(maxx,x);
        multime.push_back(x);
    }
}

int divisible[Max];
int dp[Max];
vector < pair < int , int >  > divi;
int ans = 1;
int last;
void bkt(int current)
{
    if(ans != 1)
        divisible[ans] ++;
    if(current == last)
        return;
    int base = divi[current].first;
    int power = 1;
    int exp = divi[current].second;
    if(ans == 1)
    bkt(current + 1);
    for(int i = 1; i<=exp;i++)
    {
        power *= base;
        ans *= power;
        bkt(current + 1);
        ans /= power;
    }

}
void baga(int n)
{
    divi.clear();
    int d = 2;
    while(n)
    {
        if(n%d == 0)
        {
            int e = 0;
            while(n%d == 0)
                n /= d,e++;
            divi.push_back({d,e});
        }
        d++;
        if(d*d > n)
            break;
    }
    if(n!=1)
        divi.push_back({n,1});
    divisible[1] ++;
    last = divi.size();
    bkt(0);
}
void solve()
{
    for(auto it : multime)
        baga(it);
    //dp[i] nr de perechi care au cmmdc i
    //un fel de ciur invers?
    int i,j;
    for(i = maxx; i>= 1;i--)
    {
        int val = divisible[i];
        dp[i] = (val*(val-1)) / 2;
        for(j=2;j<=maxx / i; j++)
            dp[i] -= dp[i*j];
        //scadem multipli, principiul includerii excluderii
    }
    g<<dp[1];
}
void restart()
{

}

int32_t main()
{

        read();
        solve();
        restart();
    return 0;
}