import std.stdio, std.string, std.conv, std.algorithm, std.numeric;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;

immutable long mod = 10^^9 + 7;

void main() {
    int n;
    scan(n);

    auto ps = sieveEratos(n + 1);
    auto cnt = new int[](n + 1);

    foreach (m ; 2 .. n + 1) {
        foreach (pi ; ps) {
            if (pi*pi > m) break;
            while (m % pi == 0) {
                cnt[pi]++;
                m /= pi;
            }
        }

        if (m > 1) cnt[m]++;
    }

    long ans = 1;

    foreach (cnti ; cnt) {
        (ans *= (cnti + 1)) %= mod;
    }

    writeln(ans);
}

int[] sieveEratos(int N) {
    auto s = new bool[](N);
    s[] = 1;
    s[0] = s[1] = 0;

    for (int p = 2; p*p < N; p++) {
        if (s[p]) {
            for (int q = p*p; q < N; q += p) {
                s[q] = 0;
            }
        }
    }

    return iota(N).filter!(i => s[i]).array;
}


void scan(T...)(ref T args) {
    string[] line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}


void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}