#include <cmath>
#include <algorithm>
#include <fstream>

using namespace std;

int main()
{
    int p, q, n;
    ifstream in("fractii.in");
    ofstream out("fractii.out");

    in>>n;

    int count;

    for(p = 1; p <= n; p = (q % 2 == 0) ? p + 2 : p +1) {
        for(q = 1; q <= n; q = (p % 2 == 0) ? q + 2 : q + 1)
            if(__gcd(p, q) == 1) count++;
    }

    out<<count;

    return 0;
}