void main() {
    long n = readln.chomp.to!long;
    long mod = 10 ^^ 9 + 7;
    long[] factors = new long[n+1];
    foreach (i; 1 .. n+1) {
        long d = i;
        long tmp;
        while (d % 2 == 0) {
            ++tmp;
            d /= 2;
        }
        factors[2] += tmp;
        long ind = 3;
        while (ind * ind <= d) {
            tmp = 0;
            while (d % ind == 0) {
                ++tmp;
                d /= ind;
            }
            factors[ind] += tmp;
            ind += 2;
        }
        if (d > 1) {
            ++factors[d];
        }
    }
    long result = 1;
    foreach (i; 0 .. n+1) {
        if (factors[i] > 0) {
            result = result * (factors[i] + 1) % mod;
        }
    }
    result.writeln;
}

import std.stdio;
import std.string;
import std.array;
import std.conv;
import std.algorithm;
import std.range;
import std.math;
import std.numeric;
import std.container;
import std.typecons;
import std.ascii;
import std.uni;