#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const int Mod=10007;
int n,i,j,f[10005],ans;
int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        memset(f,0,sizeof(f));
        while(n--)
        {
            scanf("%d",&i);
            for(j=1;j*j<=i;j++)if(i%j==0)
            {
                f[j]++;
                if(j*j!=i)f[i/j]++;
            }
        }
        for(i=1;i<10001;i++)f[i]=f[i]*f[i]%Mod;
        for(i=10000;i;i--)for(j=i<<1;j<10001;j+=i)f[i]=(f[i]-f[j]+Mod)%Mod;
        for(i=1,ans=0;i<10001;i++)ans=(ans+f[i]*i%Mod*(i-1)%Mod)%Mod;
        cout<<ans<<endl;
    }
    return 0;
}