#include <cstdio>
#include <cmath>
typedef long long ll;

ll gcd(ll x, ll y) {
   if (y == 0) return x;
   return gcd(y, x % y);
}

bool isPrime(ll x) {
	if (x <= 1) return false;
	for (ll i = 2; i * i <= x; ++i) {
		if (x % i == 0) {
			return false;
		}
	}
	return true;
}

int n;
ll ans;

int main() {
	freopen("gcd_prime.in", "r", stdin);
	freopen("gcd_prime.out", "w", stdout);
	scanf("%d", &n);
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			if (isPrime(gcd(i, j))) {
				ans++;
			}
		}
	}
	printf("%lld", ans);
	return 0;
}