#include <cstdio>

int n;
int prime_count;
int prime[5000050];
bool not_prime[5000050];
int last[5000050];
int prime_total[5000050];

int main(void)
{
	long long answer = 1;
	int i,j;
	
	freopen("xnumber.in","r",stdin);
	freopen("xnumber.out","w",stdout);
	
	scanf("%d",&n);
	
	for(i = 2;i <= n;++i)
	{
		if(!not_prime[i]){
			prime[prime_count++] = i;
			last[i] = prime_count - 1;
		}
		for(j = 0;j < prime_count && 1ll * i * prime[j] <= n;++j)
		{
			not_prime[i * prime[j]] = true;
			last[i * prime[j]] = j;
			if((i % prime[j]) == 0)
				break;
		}
	}
	
	for(i = 2;i <= n;++i)
	{
		j = i;
		while(j > 1)
		{
			++prime_total[last[j]];
			if(0 == (prime_total[last[j]] & 1))
				answer = (1ll * prime[last[j]] * prime[last[j]]) % 100000007 * answer % 100000007;
			j /= prime[last[j]];
		}
	}
	
	printf("%d\n",answer);
	
	return 0;
}