import java.util.*

fun main(args: Array<String>) {
    val sc = Scanner(System.`in`)
    val n = sc.nextInt()
    val isPrime = Array(n + 1, {true})
    for(i in 2..n) if(isPrime[i]) {
        for(j in (i * 2)..n step i) isPrime[j] = false
    }
    var divisorCount = 1L
    for(i in 2..n) if(isPrime[i]) {
        var factorCount = 1
        var power = i
        while(power <= n) {
            factorCount += n / power
            power *= i
        }
        divisorCount *= factorCount
        divisorCount %= 1000000007
    }
    println(divisorCount)
}
