题意:给出n,求sum(gcd(i,j)),1<=i<j<=n
/*
f[n]=gcd(1,n)+gcd(2,n)+gcd(3,n)+..+gcd(n-1.n),那么s[n]=s[n-1]+f[n]
用g[n,i]表示gcd(n,x)=i的个数,f[n]=sum(i*g[n,i]),i是n的约数
gcd(n,x)=i,gcd(n/i,x/i)=1;所以g[n,i]=phi(n/i)
枚举i,对i的所有倍数j,f[j]+=i*phi[j/i]
*/
#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#define LL long long
#define maxn 4000000
using namespace std;
LL s[maxn+1],f[maxn+1],phi[maxn+1];
void phi_table(LL n){
for(LL i=2;i<=n;i++)phi[i]=0;
phi[1]=1;
for(LL i=2;i<=n;i++)if(!phi[i])
for(LL j=i;j<=n;j+=i){
if(!phi[j])
phi[j]=j;
phi[j]=phi[j]/i*(i-1);
}
}
void init(){
phi_table(maxn);
for(LL i=1;i<=maxn;i++)
for(LL n=i*2;n<=maxn;n+=i)
f[n]+=i*phi[n/i];
for(LL i=2;i<=maxn;i++)
s[i]=s[i-1]+f[i];
}
int main()
{
init();
LL n;
while(cin>>n,n){
cout<<s[n]<<endl;
}
return 0;
}