#include <bits/stdc++.h>
using namespace std;

const int MAXN=20000+5,MOD=int(1e8+7);
int phi[MAXN],p[MAXN],cnt=0;

void Get_Phi(int n){
    phi[1]=1;
    for(int i=2;i<=n;i++){
        if(phi[i]==0) phi[i]=i-1,p[cnt++]=i;
        for(int j=0;j<cnt && p[j]*i<=n;j++)
            if(i%p[j]) phi[i*p[j]]=phi[i]*phi[p[j]];
            else {phi[i*p[j]]=p[j]*phi[i];break;}
    }
}

int main(){
    freopen("msta.in","r",stdin);
    freopen("msta.out","w",stdout);
    int n;
    cin>>n;
    Get_Phi(n);
    long long ans=1;
    for(int i=1;i<=n;i++)
        (ans*=phi[i])%=MOD;
    cout<<ans<<endl;
    return 0;
}