import std.algorithm;
import std.array;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;

T read(T)() { return readln.chomp.to!T; }
T[] reads(T)() { return readln.split.to!(T[]); }
alias readint = read!int;
alias readints = reads!int;

int[] factors(int n) {
    assert(n > 1);

    int[] ps;
    while (n % 2 == 0) {
        ps ~= 2;
        n /= 2;
    }

    for (int i = 3; i * i <= n; i += 2) {
        while (n % i == 0) {
            ps ~= i;
            n /= i;
        }
    }

    if (n > 1) ps ~= n;
    return ps;
}

long calc(int n) {
    const mod = cast(int)1e9 + 7;

    long[int] d;
    for (int i = 2; i <= n; i++) {
        foreach (x; factors(i)) {
            d[x]++;
        }
    }

    long ans = 1;
    foreach (k, v; d) {
        ans = (ans * (v + 1)) % mod;
    }
    return ans;
}

void main() {
    int n = readint;
    writeln(calc(n));
}
