#include <stdio.h>
#include <math.h>
#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

vector<pair<long long, long long> > prime_factorize(long long N) {
    vector<pair<long long, long long> > res;
    for (long long i = 2; i * i <= N; ++i) {
        if (N % i != 0) {
            continue; 
        }
        long long ex = 0; // 指数
        // 割れるだけ割る
        while (N % i == 0) {
            ++ex;
            N /= i;
        }
        // 結果を push
        res.push_back({i, ex});
    }

    // 残った数はそのまま push
    if (N != 1) {
        res.push_back({N, 1});
    } else {
        res.push_back({1, 1});
    }

    return res;
}


int main() {
    long long N, target = 1, ans = 1, num = 1000000007;
    cin >> N;

    vector<long long> ex(N+1, 0); //指数情報を格納していく
    for (int i = 1; i <= N; ++i) {
        const auto &res = prime_factorize(i);
        for (auto p : res) {
            ex[p.first] += p.second;
        }
    }

    for (long long i = 2; i <= N; ++i) {
        ans *= ex[i] + 1 ;
        ans %= num;
    }

    cout << ans << endl;

    return 0;
}

// C - Factors of Factorial
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
#define int long long
#define MOD 1000000007
typedef vector<int> vi;
typedef pair<int,int> pi;
#define inf 1e18
#define For(i,a,b) for (int i = a; i < b; i++)
#define Rep(i,a,b) for (int i = a; i <= b; i++)
#define ps(x,y) fixed << setprecision(y) << x 
#define pb push_back 
#define mp make_pair 

int sieve[1005];
vi primes;

int32_t main()
{
    fast;
    int n, ans = 1; cin >> n;
    for(int x = 2; x <= n; x++) {
        if(sieve[x]) continue;
        for(int u = 2*x; u <= n; u += x) {
            sieve[u] = x;
        }
    }

    Rep(i, 2, n) {
        int cnt = 0;
        if(sieve[i] == 0) {
            int exp = 1;
            while(pow(i, exp) <= n) {
                int x = pow(i, exp);
                cnt += (n/x);
                exp++;
            }
            ans *= (cnt+1);
            ans %= MOD;
        }
    }

    cout << ans;
   
    
    return 0;
}