#include<iostream> 
#include<vector> 
using namespace std; 
typedef unsigned long long int ull; 
vector<ull> 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); 
} 
ull factorialDivisors(ull n) 
{ 
    sieve(n); 
    ull result = 1;
    for (int  i=0; i < allPrimes.size(); i++) 
    { 
        ull p = allPrimes[i]; 
        ull exp = 0; 
        while (p <= n) 
        { 
            exp = exp + (n/p); 
            p = p*allPrimes[i]; 
        } 
        result = (result*(exp+1))%1000000007; 
    } 
    return result; 
}

int main() 
{ 
    int n; cin>>n;
    cout << factorialDivisors(n); 
    return 0; 
} 

#include <bits/stdc++.h>
#include <math.h>
#define ALL(a)    a.begin(), a.end() 
#define rep(i, K, N)  for(long long int i = K; i <= N; i++)
#define ll long long int
#define PP 1000000007
using namespace std;

map<ll, ll> M;

void prime_factor(ll N){

bool C = 1;

while(C){

C = 0;

    rep(i, 2, sqrt(N)){

    if(N%i == 0){M[i]++;N /= i;C = 1;break;}
   
    }

}

M[N]++;

}

int main() {
ll N, Ans = 1;cin >> N;

rep(i, 2, N){

  prime_factor(i);

}

for(auto x : M ){

  Ans *= x.second + 1;Ans %= PP;

}

cout << Ans;

}