/*One Night Of The Hunters*/
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>
#include<iomanip>
#include<stack>
#include<map>
#include<set>
#include<cmath>
#define debug(x) cerr<<#x<<"="<<x<<endl
#define INF 0x7f7f7f7f
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
inline int init()
{
	int now=0,ju=1;char c;bool flag=false;
	while(1)
	{
		c=getchar();
		if(c=='-')ju=-1;
		else if(c>='0'&&c<='9')
		{
			now=now*10+c-'0';
			flag=true;
		}
		else if(flag)return now*ju;
	}
}
inline long long llinit()
{
	long long now=0,ju=1;char c;bool flag=false;
	while(1)
	{
		c=getchar();
		if(c=='-')ju=-1;
		else if(c>='0'&&c<='9')
		{
			now=now*10+c-'0';
			flag=true;
		}
		else if(flag)return now*ju;
	}
}
int prime[1000001];
bool isprime[5000001];
int cnt=0;
int n;
const int mod=100000007;
ll quick_pow(ll base,ll power)
{
	ll ret=1;
	for(;power;power>>=1)
	{
		if(power&1)
		{
			ret=((ret%mod)*(base%mod))%mod;
		}
		base=((base%mod)*(base%mod))%mod;
	}
	return ret;
}
ll solve(int x)
{
	ll y=n,z=0;
	while(y)
	{
		y/=x;
		z+=y;
	}
	if(z&1)
	{
		return quick_pow(x,z-1);
	}
	else return quick_pow(x,z);
}
ll ans=1;
void euler()
{
	memset(isprime,1,sizeof(isprime));
	for(int i=2;i<=n;i++)
	{
		if(isprime[i])
		{
			prime[++cnt]=i;
			ans=((ans%mod)*(solve(i)%mod))%mod;
		}
		for(int j=1;j<=cnt;j++)
		{
			if(prime[j]*i>n)break;
			isprime[prime[j]*i]=false;
			if(i%prime[j]==0)break;
		}
	}
}
int main()
{
	freopen("xnumber.in","r",stdin);
	freopen("xnumber.out","w",stdout);
	int p;
	n=init();
	euler();
	printf("%d\n",ans);
	return 0;
}

/*
srO xudyh davidlee1999WTK linkct1999 Orz
compiler TDM-GCC 5.9.2
*/