#include<iostream>
#include<cstring>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cmath>
#include<utility>
#include<cstdlib>
#include<iomanip>	//cout<<setiosflags(ios::fixed)<<setprecision(2);
#include<ctime> //double a=(double)clock();	cout<<a<<endl;
#include<vector>
#include<queue>
using namespace std;
const int MOD=100000007;
const int maxn=20010;
inline int read(){
	int x=0,ff=1;char ch=getchar();
	while(ch>'9'||ch<'0'){if(ch=='-')ff=-1; ch=getchar();}
	while(ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=getchar();}
	return ff*x;
}
int N,ans=1,phi[maxn],limit;
int get_eular(int x){
	int ret=x;
	limit=(int)sqrt(1.0*x);
	for(int i=2;i<=limit;i++){
		if(x%i==0){
			ret=ret/i*(i-1);
			while(x%i==0)
				x/=i;
		}
	}
	if(x!=1)
		ret=ret/x*(x-1);
	return ret;
}
int main(){
	freopen("msta.in","r",stdin);
	freopen("msta.out","w",stdout);
	N=read();
	for(int i=1;i<=N;i++)
		phi[i]=get_eular(i);
	for(int i=1;i<=N;i++)
		ans=1LL*ans*phi[i]%MOD;
	printf("%d\n",ans);
	return 0;
}