#include <fstream>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_map>
#include <map>
#include <queue>
#include <stack>
#define N 1000006
#define ll long long
#define M 1000000007
#define PI 3.14159265
using namespace std;
ifstream in("fractii.in");
ofstream out("fractii.out");
ll f[N], a[N];
int main(){
    int n,i,j;
    ll s=0;
    in>>n;
    for(i=2; i<=n; ++i){
        a[i]=f[i]=1;
    }
    for(i=2; i<=n; ++i){
        if(f[i]==1){
            for(j=i; j<=n; j+=i){
                a[j]*=j;
                f[j]*=(j-j/i);
            }
        }
        s+=1LL*i*(f[i]/a[i]);
    }
    out<<2*s+1;
    return 0;
}