#include<fstream>

/*
* SORT HEAP
*/

int n;
int total = 0;

std::ifstream in("fractii.in");
std::ofstream out("fractii.out");

void calculate();
bool primes(int i, int j);
int min(int i, int j);

int main() {
	in >> n;
	calculate();
	out << total;
}

void calculate() {
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++) {
			if (primes(i, j)) {
				total++;
			}
		}
}

bool primes(int i, int j) {
	if (i == 1 || j == 1) return true;
	if (i == j) return false;
	else {
		int tmp;
		while (j != 0) {
			if (i < j) {
				tmp = i;
				i = j;
				j = tmp;
			}
			tmp = j;
			j = i % j;
			i = tmp;
		}
		return i == 1;
	}
}

int min(int i, int j) {
	return i < j ? i : j;
}