Irrelevant Elements UVA - 1635

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;

const int maxn=50100;
ll ans[maxn];
ll phi[maxn];
/*
计算欧拉phi函数值 
*/

ll get_f(int n){
	fill(phi,phi+maxn,0);
//	phi[1]=1;//???
	for(int i=2;i<=n;i++){
		if(!phi[i]){
			for(int j=i;j<=n;j+=i){
				if(!phi[j])phi[j]=j;
				phi[j]=phi[j]/i*(i-1);
			}
		}
	}	
}


void init(){
	get_f(maxn-100);
	for(int i=2;i<=50000;i++){
		ans[i]=ans[i-1]+phi[i];
	}
}

int main(){
	init();
	int n;
	while(scanf("%d",&n)==1&&n){
		printf("%lld\n",2*ans[n]+1);
	}
	return 0;
}