/*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define   mod  998244353
#define   int  long long 
#define   ld long double
#define   pb push_back
#define  sz(x)  (int)x.size()
#define  ff first
#define  ss second
#define  pii  pair<int,int>
using namespace std; 

vector<int> allPrimes; 
 
void sieve(int n) 
{ 
    vector<bool> prime(n+1, true); 
    for (int p=2; p*p<=n; p++) { 
        if (prime[p] == true) { 
            for (int i=p*2; i<=n; i += p) 
                prime[i] = false; 
        } 
    } 
    for (int p=2; p<=n; p++) 
        if (prime[p]) 
            allPrimes.push_back(p); 
} 
int solve(int n) 
{ 
    sieve(n); 
    int result = 1;
    for (int  i=0; i < allPrimes.size(); i++) 
    { 
        int p = allPrimes[i]; 
        int x = 0; 
        while (p <= n) 
        { 
            x = x + (n/p); 
            p = p*allPrimes[i]; 
        } 
        result = (result*(x+1))%1000000007; 
    } 
    return result; 
}
 


signed main()
{
    int n=1; cin>>n;
    cout << solve(n) << endl ;
    return 0;
}

#include<bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (int)(n); i++)
#define sum(a) accumulate(a.begin(),a.end(),0LL)
#define put(i) cout<<fixed<<i<<endl
using namespace std;
using ll = long long;

ll mod = 1e9+7;
vector<ll> cnt(1e3+1,0);

void disassenmble(ll n){
   for(long long i = 2; i * i <= n; i++){
       if(n % i != 0){ continue; }
       ll ex = 0;
       while(n % i == 0){
           ex++;
           n /= i;
       }
       cnt[i] += ex;
   }
   if(n != 1) ++cnt[n];
}

int main(){
    ll n; cin >> n;

    ll ans = 1;
    for(long long i = 1; i <= n; i++) disassenmble(i);
    for(long long i = 2; i <= n; i++){
        if(cnt[i]) ans = (ans * (cnt[i] + 1)) % mod;
    }
    //for(long long i = 0; i <= n; i++){ cout << cnt[i] << " ";} cout << endl;
    put(ans);
}