#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<math.h>
#include<map>
using namespace std;

#define MST(vis,x) memset(vis,x,sizeof(vis))
#define INF 0x3f3f3f3f
#define ll long long
#define ull unsigned long long
#define maxn  50010
#define mod  1000000007

int phi[maxn];
int main()
{

    int n;
    while(scanf("%d",&n)!=EOF)
    {
        if(n==0)break;
        MST(phi,0);
        phi[1]=1;
        for(int a=2; a<=n; a++)if(!phi[a])
            {
                for(int b=a; b<=n; b+=a)
                {
                    if(!phi[b])phi[b]=b;
                    phi[b]=phi[b]/a*(a-1);
                }
            }
        ll sum=0;
        for(int a=2; a<=n; a++)
            sum+=phi[a];
        printf("%lld\n",2*sum+1);
    }
    return 0;
}