#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int main() {
	int N;
	cin >> N;
	
	vector<int> spf(N + 1, -1);
	for(int i = 2; i <= N; ++i) if(spf[i] == -1) {
		for(int j = i; j <= N; j += i) if(spf[j] == -1) spf[j] = i;
	}
	
	vector<int> mu(N + 1, 1), phi(N + 1, 1);
	for(int i = 2; i <= N; ++i) {
		int p = spf[i], m = i / p;
		
		if(m % p == 0) {
			mu[i] = 0;
			phi[i] = phi[m] * p;
		} else {
			mu[i] = mu[m] * -1;
			phi[i] = phi[m] * (p - 1);
		}
	}
	
	ll musum = 0, phisum = 0;
	for(int i = 1; i <= N; ++i) musum += mu[i], phisum += phi[i];
	
	cout << musum << " " << phisum << endl;
}