import core.bitop;
import std.algorithm;
import std.ascii;
import std.bigint;
import std.conv;
import std.functional;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.random;
import std.typecons;
import std.container;

alias sread = () => readln.chomp();
ulong MOD = 1_000_000_007;
ulong INF = 1_000_000_000_000;
ulong MIDDLE = 100_000;
alias Pair = Tuple!(long, "flag", long, "num");

T lread(T = long)()
{
    return readln.chomp.to!T();
}

T[] aryread(T = long)()
{
    return readln.split.to!(T[])();
}

void scan(TList...)(ref TList Args)
{
    auto line = readln.split();
    foreach (i, T; TList)
    {
        T val = line[i].to!(T);
        Args[i] = val;
    }
}

void main()
{
    auto n = lread();
    auto prime = new long[](n);
    long len;
    foreach (i; iota(2, n + 1))
    {
        long flag = 1;
        foreach (j; iota(2, i))
            flag = flag && i % j;

        if (flag)
            prime[len++] = i;
    }
    auto prime_fact = new long[](n + 1);
    foreach (i; iota(1, n + 1))
    {
        foreach (j; iota(len))
        {
            while (i > 0 && !(i % prime[j]))
            {
                i /= prime[j];
                prime_fact[prime[j]]++;
            }
        }
    }
    long ans = 1;
    foreach (e; prime_fact)
    {
        if (e)
        {
            ans *= e + 1;
            ans %= MOD;
        }
    }
    ans.writeln();
}
