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 s = iota(n + 1).array;
    long ans = 1;

    foreach (p ; 2 .. n + 1) {
        if (s[p] > 1) {
            int cnt = 1;

            for (int q = p; q < n + 1; q += p) {
                while (s[q] % p == 0) {
                    cnt++;
                    s[q] /= p;
                }
            }

            (ans *= cnt) %= mod;
        }
    }

    writeln(ans);
}



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);
        }
    }
}