#include <fstream>
#include <algorithm>
using namespace std;

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

int n, cnt = 1;
double a;
double b[1000000];

int main()
{
    is >> n;
    for ( double i = 1; i <= n; i++ )
        for ( double j = 1; j <= n; j++ )
        {
            a = i / j;
            b[cnt] = a;
            cnt++;
        }
    sort ( b + 1, b + cnt );
    int fs = cnt;
    for ( int i = 1; i <= cnt; i++ )
        if ( b[i] == b[i + 1] )
            fs--;
    os << fs;
    is.close();
    os.close();
    return 0;
}