#include "bits/stdc++.h"
using namespace std;
#define fastio ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
#define vint vector<int>
#define pii pair<int, int>
#define mii map<int, int>
#define int long long
#define nl '\n'
const int N = 2e5 + 10;
const int MOD = 1e9 + 7;
mii factors;
void primeFactorize(int n) {
for (int i = 2; i * i <= n; ++i) {
if (n % i == 0) {
int count = 0;
while (n % i == 0) {
n /= i;
count++;
}
factors[i] += count;
}
}
if (n > 1) factors[n] = 1;
}
void solve() {
int n; cin>>n;
int ans = 1;
for (int i = 2; i <= n; i++)
primeFactorize(i);
for (auto& [a, b] : factors)
ans = ans%MOD * (b + 1)%MOD;
cout<<ans%MOD<<nl;
}
int32_t main() {
fastio
int t = 1; //cin>>t;
while (t--) solve();
return 0;
}
I2luY2x1ZGUgImJpdHMvc3RkYysrLmgiCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiNkZWZpbmUgZmFzdGlvIGlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oMCk7IGNpbi50aWUoTlVMTCk7IGNvdXQudGllKE5VTEwpOwojZGVmaW5lIHZpbnQgdmVjdG9yPGludD4KI2RlZmluZSBwaWkgcGFpcjxpbnQsIGludD4KI2RlZmluZSBtaWkgbWFwPGludCwgaW50PgojZGVmaW5lIGludCBsb25nIGxvbmcKI2RlZmluZSBubCAnXG4nCmNvbnN0IGludCBOID0gMmU1ICsgMTA7CmNvbnN0IGludCBNT0QgPSAxZTkgKyA3OwoKbWlpIGZhY3RvcnM7CnZvaWQgcHJpbWVGYWN0b3JpemUoaW50IG4pIHsKICAgIGZvciAoaW50IGkgPSAyOyBpICogaSA8PSBuOyArK2kpIHsKICAgICAgICBpZiAobiAlIGkgPT0gMCkgewogICAgICAgICAgICBpbnQgY291bnQgPSAwOwogICAgICAgICAgICB3aGlsZSAobiAlIGkgPT0gMCkgewogICAgICAgICAgICAgICAgbiAvPSBpOwogICAgICAgICAgICAgICAgY291bnQrKzsKICAgICAgICAgICAgfQogICAgICAgICAgICBmYWN0b3JzW2ldICs9IGNvdW50OwogICAgICAgIH0KICAgIH0KICAgIGlmIChuID4gMSkgZmFjdG9yc1tuXSA9IDE7Cn0KCnZvaWQgc29sdmUoKSB7CiAgICBpbnQgbjsgY2luPj5uOwogICAgaW50IGFucyA9IDE7CiAgICBmb3IgKGludCBpID0gMjsgaSA8PSBuOyBpKyspCiAgICAgICAgcHJpbWVGYWN0b3JpemUoaSk7CgogICAgZm9yIChhdXRvJiBbYSwgYl0gOiBmYWN0b3JzKQogICAgICAgIGFucyA9IGFucyVNT0QgKiAoYiArIDEpJU1PRDsKICAgICAgCiAgICBjb3V0PDxhbnMlTU9EPDxubDsKCgp9CiAKaW50MzJfdCBtYWluKCkgewogICAgZmFzdGlvCiAgICBpbnQgdCA9IDE7IC8vY2luPj50OwogICAgd2hpbGUgKHQtLSkgc29sdmUoKTsKICAgIHJldHVybiAwOwp9