#include <iostream>
#include <fstream>
using namespace std;
int euclid(int a, int b)
{
    int c;
    while (b) {
        c = a % b;
        a = b;
        b = c;
    }
    return a;
}
int main()
{
    ifstream f("fractii.in");
    ofstream g("fractii.out");
    int k=5,i,j;
    int  N, I, J;
    long long C[10000];
    f>>N;
    for(I=1;I<=N;I++)
        C[I]=1;
    for(I=2;I<=N;I++)
        if(C[I]==1)
        for(J=2;J*I<=N;J++)
        C[I*J]=0;
    for(I=3;I<=N;I+=2)
        if(C[I]==1)
        k+=N-1;
    for(I=2;I<=N;I+=2)
        k+=N-2;
    g<<k;





    return 0;
}