#include<iostream>

 #include<cstdio>

 #include<cstring>

 #define ll long long

 #define mod 100000007

 using namespace std;

 const int N=5e8+;

 int prime[N],tot,n;

 bool check[N];

 void pre()

 {

     for(int i=;i<=n;i++)

     {

         if(!check[i]) prime[++tot]=i;

         for(int j=;j<=tot&&prime[j]*i<=n;j++)

         {

             check[prime[j]*i]=;

             if(i%prime[j]==) break;

         } 

     }

 }

 int main()

 {

     scanf("%d",&n);

     pre();

     memset(check,false,sizeof check );

     for(ll res,i=;i<=tot;i++)

     {

         res=;

         for(ll j=prime[i];j<=n;j*=(ll)prime[i]) res+=n/j;

         if(res&) check[prime[i]]=;

     }

     ll ans=;

     for(int i=;i<=n;i++)

       if(!check[i]) ans=ans*i%mod;

     printf("%I64d",ans);

     return ;

 }