#include <cmath>
#include <iostream>
#include <vector>


int main() {
    int number;
    std::cin >> number;
    std::vector<int>numbers(number+1);
    std::vector<int> primes;

    for (int i=2; i<=number; ++i) {
        if (numbers[i] == 0) {
            numbers[i] = i;
            primes.push_back(i);
        }
        for (int j=0; j<(int)primes.size() && primes[j]<=numbers[i] && i*primes[j]<=number; ++j)
            numbers[i * primes[j]] = primes[j];
    }
    int64_t divisors = 1;
    for (auto prime: primes) {
        int amount = 0;
        int degree = prime;
        while (degree <= number){
            amount += number / degree;
            degree *= prime;
        }
        divisors *= (amount + 1);
        divisors %= 1000000007;
    }
    std::cout << divisors;
}