#include <stdio.h>

#define MAXN 1000001

int n;
int ciur[MAXN];

int max(int a, int b) {
	return a < b ? b : a;
}

void init_ciur(int val) {
	for (int i = 0; i <= n; i++) {
		ciur[i] = val;
	}
}

void make_fi_of_n_ciur() {
	for (int i = 2; i <= n; i++) {
		if (ciur[i] & 1) {
			int max_steps = (n - i) / i;
			int pos = i << 1;
			ciur[i] = i - 1;
			for (int steps = 0; steps <= max_steps; steps++, pos += i) {
				int pow = 1;
				int aux = pos;
				while (aux % i == 0) {
					pow *= i;
					aux /= i;
				}
				ciur[pos] = (i-1)*(pow / i);
			}
		}
	}
}

int main() {
	freopen("fractii.in", "r", stdin);
	freopen("fractii.out", "w", stdout);

	scanf("%d", &n);

	init_ciur(1);

	make_fi_of_n_ciur();

	int sum = 1;
	for (int i = 2; i <= n; i++) {
		sum += 2*ciur[i];
	}
	printf("%d\n", sum);

	return 0;
}