#pragma comment(linker,"/STACK:1024000000,1024000000")

#include <cstdio>

#include <cstring>

#include <string>

#include <cmath>

#include <limits.h>

#include <iostream>

#include <algorithm>

#include <queue>

#include <cstdlib>

#include <stack>

#include <vector>

#include <set>

#include <map>

#define LL long long

#define mod 100000000

#define inf 0x3f3f3f3f

#define eps 1e-6

#define N 222222

#define lson l,m,rt<<1

#define rson m+1,r,rt<<1|1

#define PII pair<int,int>

using namespace std;

inline int read()

{

    char ch=getchar();int x=,f=;

    while(ch>''||ch<''){if(ch=='-')f=-;ch=getchar();}

    while(ch<=''&&ch>=''){x=x*+ch-'';ch=getchar();}

    return x*f;

}

bool vis[N+];

int mu[N+],prime[N+],sum[N+];

void Mobius()

{

    memset(vis,false,sizeof(vis));

    mu[]=;

    int tot=;

    for(int i=;i<=N;i++)

    {

        if(!vis[i])

        {

            prime[tot++]=i;

            mu[i]=-;

        }

        for(int j=;j<tot;j++)

        {

            if(i*prime[j]>N)break;

            vis[i*prime[j]]=true;

            if(i%prime[j]==)

            {

                mu[i*prime[j]]=;

                break;

            }

            else

            {

                mu[i*prime[j]]=-mu[i];

            }

        }

    }

    for(int i=;i<=N;i++)sum[i]=sum[i-]+mu[i];

}

int num[N+],cnt[N+];

LL solve(int n)

{

    LL res=;

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

    {

        if(!cnt[i])continue;

        res+=1LL*mu[i]*cnt[i]*(cnt[i]-)/;

    }

    return res;

}

int main()

{

    int n,x;

    Mobius();

    while(scanf("%d",&n)>)

    {

        memset(num,,sizeof(num));

        memset(cnt,,sizeof(cnt));

        int mx=;

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

        {

            x=read();

            num[x]++;

            mx=max(x,mx);

        }

        for(int i=;i<=mx;i++)

            for(int j=i;j<=mx;j+=i)

            cnt[i]+=num[j];

        LL ans=solve(mx);

        printf("%lld\n",ans);

    }

}