#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <fstream>
#include <cmath>

int main(int argc, char **argv)
{
#ifndef TEST
    std::ifstream f("fractii.in");
    assert(f.is_open());

    int n;
    f >> n;
    f.close();
#else
    int n = atoi(argv[1]);
#endif

    int nr = (2*(n-1))+1;
    for(int i = 2; i <= n; ++i) {
        for(int j = 2; j <= n; ++j) {
            if(i==j) continue;

            bool irreducible = true;
            for(int k = 2; k <= std::min(i,j); ++k) {
                if(i%k == 0 && j%k == 0) {
                   irreducible = false;
                   break;
                }
            }
            if(irreducible) {
                ++nr;
            }
        }
    }

#ifndef TEST
    std::ofstream o("fractii.out");
    o << nr;
    o.close();    
#else
    return nr;
#endif

    return 0;
}