#include<bits/stdc++.h>

#define LL long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back

using namespace std;

LL gcd(LL a,LL b){return b?gcd(b,a%b):a;}
LL lcm(LL a,LL b){return a/gcd(a,b)*b;}
LL powmod(LL a,LL b,LL MOD){LL ans=1;while(b){if(b%2)ans=ans*a%MOD;a=a*a%MOD;b/=2;}return ans;}

int p[1111],cnt,a[1111],n;
void P(){
	for(int i=2;i<=1000;i++){
		if(!p[i])a[++cnt]=i;
		for(int j=1;j<=cnt and a[j]*i<=1000;j++){
			p[a[j]*i]=1;
			if(i%a[j]==0)break;
		}
	}
}
int Q[1111];
int main(){
	ios::sync_with_stdio(false);
	P();
	cin>>n;
	for(int i=1;i<=n;i++){
		int now=i;
		for(int j=1;a[j]*a[j]<=now;j++){
			if(now%a[j]==0){
				while(now%a[j]==0)Q[a[j]]++,now/=a[j];
			}
		}
		if(now>1)Q[now]++;
	}
	LL ans=1,mod=1e9+7;
	for(int i=1;i<=1000;i++){
		if(Q[i]){
			ans*=Q[i]+1;
			ans%=mod;
		}
	}
	cout<<ans;
	return 0;
}
