#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int MAXN = 1e6;

const int MOD = 1e9 + ;

ll N,i,k,ans=,tot=;

ll prime[MAXN+],f[MAXN+],sum[MAXN+];

template <typename T> inline void read(T &x) {

        ll f=; x=;

        char c = getchar();

        for (; !isdigit(c); c = getchar()) { if (c == '-') f = -f; }

        for (; isdigit(c); c = getchar()) x = x *  + c - '';

        x *= f;

}

template <typename T> inline void write(T x) {

    if (x < ) { putchar('-'); x = -x; }

    if (x > ) write(x/);

    putchar(x%+'');

}

template <typename T> inline void writeln(T x) {

    write(x);

    puts("");

}

inline void sieve(ll n) {

        ll i,j,tmp;

        for (i = ; i <= n; i++) {

                if (!f[i]) prime[++tot] = f[i] = i;

                for (j = ; j <= tot; j++) {

                        tmp = i * prime[j];

                        if (tmp > n) break;

                        f[tmp] = prime[j];

                        if (f[i] == prime[j]) break;

                }

        }

}

inline void calc(ll x) {

        while (x != ) {

                sum[f[x]]++;

                x /= f[x];

        }

}

int main() {

        read(N);

        sieve(N);

        for (i = ; i <= N; i++) calc(i);

        for (i = ; i <= tot; i++) ans = ans * ( * sum[prime[i]] + ) % MOD;

        writeln(ans);

        return ;

}