#include<iostream>
#include<cstdio>
#include<cmath>
#define Ll long long
using namespace std;
const int M=1e8;
int q[5761456],tot;
bool com[M+5];
int n,mo=1000000007,x;
Ll ans;
void findcom(){
    com[1]=1;
    for(int i=2;i<=n;i++){
        if(!com[i]){q[++tot]=i;}
        for(int j=1;j<=tot;j++){
            if(i*q[j]>n)break;
            com[i*q[j]]=1;
            if(i%q[j]==0)break;
        }
    }
}
Ll ksm(int x,int y){
	Ll ans=1;
	while(y>0){
		if(y&1)ans=ans*x;
		y=y>>1;
		x=x*x;
		if(x>=mo)x%=mo;
		if(ans>=mo)ans%=mo;
	}
	return ans;
}
int main(){
    scanf("%d",&n);
    findcom();
    ans=1;
    for(int i=1;i<=tot;i++){
    	x=q[i];
    	if(x>n)break;
    	int y=log(n)/log(x);
    	ans=ans*ksm(x,y);
    	if(ans>=mo)ans%=mo;
    }
    printf("%d",int(ans));
}