#include<iostream>
#include<fstream>
using namespace std;
unsigned long n,i,j,q;
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");
    f>>n;
    q=2*n-1; //scap de cazul cand i=1 sau j=1;
    for(i=2;i<=n;i++)
        for(j=2;j<=n;j++)
            if(i!=0 && j==0 || j!=0 && j!=0 || i!=0 && j!=0) //nu se poate intampla ca ambele numere sa fie pare 
                if(euclid(i,j)==1)
                        q++;
    g<<q;
    return 0;
}