#include <iostream>
#include <fstream>

using namespace std;

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

const int MAXN = 1e6 + 10;

long long phi[MAXN], n;

void initialize() {
    for (int i = 1; i <= n; ++i)
        phi[i] = i;
}

void solve() {
    for (int i = 2; i <= n; ++i) {
        if (phi[i] == i)
            phi[i] = i - 1;
        for (int j = 2 * i; j <= n; ++j)
            phi[j] = (phi[j] * (i - 1)) / i;
    }
}

long long sum() {
    long long sum = 0;
    for (int i = 1; i <= n; ++i)
        sum += phi[i];
}

int main() {
    fin >> n;
    solve();
    fout << sum;
    return 0;
}