fun main(args: Array<String>) {
    val n = readLine()?.toInt() ?: return
    if (n == 1) {
        println("1")
        return
    }
    val m = (1e9 + 7).toLong()
    val primes = hashMapOf<Long, Long>()
    2.until(n + 1).forEach {
        var r = it.toLong()
        var p = 2L
        while (r != 1L) {
            if (r % p == 0L) {
                r /= p
                primes[p] = primes[p]?.let { it + 1 } ?: 1
            } else {
                if (p == 2L) {
                    p += 1L
                } else {
                    p += 2L
                }
            }
        }
    }
    val count = primes.values.map { it + 1 }.reduce { a, b -> (a * b) % m }
    println(count.toString())
}
