#include <iostream>
#include <math.h>
using namespace std;

void factor(int n,int arr[]){
	for(int i=2;i<=n;i++){
		if(n%i==0){
			arr[i]+=1;
			factor(n/i,arr);
			break;
		}
		
	}
}

int main() {
	int n;
	cin>>n;
	int arr[n+1]={0};
	for(int i=1;i<=n;i++){
		factor(i,arr);
	}
	long int result=1;
	for(int i=0;i<=n;i++){
		if(arr[i]>0){
			result*=arr[i]+1;
			result=result%(1000000000+7);
		}
   }
   cout<<result;
	
}
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb(x) push_back(x)
#define INF 2e9
#define LINF 1e18
#define mod 1000000007
template<class T> inline bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; }
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const int di[4] = {1,0,-1,0};
const int dj[4] = {0,1,0,-1};

map<ll, int> res;

void factorize(ll n) {
    for (int i=2; i*i<=n; i++) {
        while (n%i == 0) {
            ++res[i];
            n /= i;
        }
    }
    if (n != 1) ++res[n];
}

int main() {
    ll n; cin >> n;
    REP(i,2,n+1) factorize(i);
    ll ans = 1;
    rep(i,n+1) {
        ans *= res[i]+1;
        ans %= mod;
    }
    // for (auto x : res) {
    //     ans *= x.second+1;
    //     ans %= mod;
    // }
    cout << ans << endl;
}