#include <fstream>
#include <iostream>

using namespace std;

ifstream in("fractii.in");
ofstream out("fractii.out");

bool calcPrime(int a, int n)
{
    for (int i = 2; i <= a; i++)
    {
        if (((a % i == 0) && (n % i == 0)))
        {
            //out << "is red: " << a << " " << n << " "
            //    << " by " << i << '\n';
            return 0;
        }
    }
    //out << "is not red: " << a << " " << n << '\n';
    return 1;
}

int main()
{
    int n;
    in >> n;
    in.close();

    int ired = n * 2 - 1; //toate fractiile de tipul 1/a , a  de la 1 la n sunt ired
    // toate fractiile de tipul a/1, doar ca scot 1/1, a fost adaugat deja
    //pentru fiecare numar prim cu n, adun 2

    for (int p = 2; p <= n; p++)
        for (int q = 2; q <= n; q++)
            if (calcPrime(p, q))
                ired++;

    out << ired;
    out.close();
    return 0;
}