#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstdlib>
#include <ctime>
#include <sstream>
#include <queue>
#include <set>
#include <map>
using  namespace std;

const int maxn=5000000+10;
const int maxm=1000+10;
const int mod=100000007;
int n,m;
int f[maxn],cnt[maxn];;
long long ans=1;
bool a[maxn];
int len;

void work(int x)
{
	int p=0;
	while(x!=1)
	{
		if(x%f[p]==0)
		{
			cnt[ f[p] ]++;
			x/=f[p];
			ans=(ans*f[p])%mod;
		}
		else
			p++;
	}
}
int main()
{
	freopen("xnumber.in","r",stdin);
	freopen("xnumber.out","w",stdout); 
	cin>>n;
	for (int i=2; i<=n; i++)  //欧拉筛 
	{
		if (!a[i])
		{
			f[len++]=i;
		}
		for (int j=0; j<len && i*f[j]<=n; j++)
		{
			a[i*f[j]]=true;
			if (!(i%f[j])) break;
		}
	}
	for(int i=n; i>=2;i--)
	{
		if( a[i] )
			work(i);
		else if(!a[i])
		{
			if( cnt[ i ]%2 ==1)
				ans=(ans*i)%mod;
			}	
	}
	cout<<ans<<endl;
	return 0;
}