#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e6+20;
const int mod=1e9+7;
ll f[N],cnt[N],pw2[N];
int n,a[N];
int main()
{
    pw2[0]=1;
    for(int i=1;i<N;i++)
        pw2[i]=(pw2[i-1]*2ll)%mod;
    while(cin>>n)
    {
        memset(f,0,sizeof(f));
        int mx=0;
        ll ans=0;
        for(int i=1;i<=n;i++)
            scanf("%d",&a[i]),cnt[a[i]]++,mx=max(mx,a[i]);
        for(int i=mx;i>=2;i--)
        {
            ll tot=0;
            for(int j=i;j<=mx;j+=i)
                tot+=cnt[j];
            ll res=(tot*pw2[tot-1])%mod;//(i=1~n)C(n,i)*i = n*2^(n-1)
            for(int j=i+i;j<=mx;j+=i)
                res=(res-f[j]+mod)%mod;    
            f[i]=res;
            ans=(ans+(ll)i*f[i]%mod)%mod;    
        }
        cout<<ans<<endl;
    }
    return 0;
}