luogoP2568 GCD(反演，分块)

const int N = 1e7 + 7;
int p[N + 1],mob[N+1],sum[N+1], cnt;
bool vis[N + 1];
void x_x()
{
	mob[1] = 1;
	f(i, 2, N)
	{
		if (!vis[i])
		{
			p[++cnt] = i;
			mob[i] = -1;
		}
		for (int j = 1;p[j] <= N / i;j++)
		{
			vis[p[j] * i] = true;
			if (i%p[j] == 0)
			{
				mob[p[j] * i] = 0;
				break;
			}
			mob[p[j] * i] = -mob[i];
		}
	}
	f(i, 1, N)sum[i] = sum[i - 1] + mob[i];
}
ll cal(int n)
{
	ll ans = 0;
	for (int l = 1, r;l <= n;l = r + 1)
	{
		r = n / (n / l);
		ans += (ll)(n / l)*(n / l)*(sum[r] - sum[l - 1]);
	}
	return ans;
}
int main()
{
	//freopen("in.txt", "r", stdin);
	x_x();
	int n;
	while (cin >> n)
	{
		int pos = lower_bound(p + 1, p + 1 + cnt, n)-p;
		ll ans = 0;
		f(i, 1, pos)ans += cal(n/p[i]);
		cout << ans << endl;
	}
	return 0;
}