#include <cstdio>
#include <iostream>
#define MOD 100000007
using namespace std;
int phi[20010];
bool flag[20010];
int prime[20010], cnt;
void prepare(int n)
{
	phi[1] = 1;
	for (int i = 2; i <= n; i++)
	{
		if (!flag[i])
		{
			prime[cnt++] = i;
			phi[i] = i - 1;
		}
		for (int j = 0; j < cnt; j++)
		{
			if (i * prime[j] > n)
				break;
			if (i % prime[j] == 0)
			{
				flag[i * prime[j]] = 1;
				phi[i * prime[j]] = phi[i] * prime[j];
				break;
			}
			flag[i * prime[j]] = 1;
			phi[i * prime[j]] = phi[i] * phi[prime[j]];
		}
	}
}
int main()
{
	freopen("msta.in", "r", stdin);
	freopen("msta.out", "w", stdout);
	int n;
	scanf("%d", &n);
	prepare(n);
	long long ans = 1;
	for (int i = 2; i <= n; i++)
		ans = (ans * phi[i]) % MOD;
	cout << ans << endl;
	return 0;
}