#include<fstream>

/*
* SORT HEAP
*/

int n;
int total = 0;

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

int main() {
	read();
	calculate();
	write();
}

void read() {
	std::ifstream in("fractii.in");
	in >> n;
	in.close();
}

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;
	if (j == 1) return true;
	else {
		int mini = min(i, j);
		for (int k = 2; k <= mini; k++)
			if (!(i % k) && !(j % k)) return false;
	}
}

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

void write() {
	std::ofstream out("fractii.out");
	out << total;
	out.close();
}