object Main extends App {
  val sc = new java.util.Scanner(System.in)
  val n = sc.nextInt()

  val mod = 1000000007
  def times(a: Long, b: Long): Long = (a * b) % mod

  def factorize(n: Int): IndexedSeq[Int] = {
    var res = IndexedSeq[Long]()
    var i = 2L
    var m = n.toLong
    while (i * i <= m) {
      while (m % i == 0) {
        res :+= i
        m /= i
      }
      i += 1
    }

    if (m != 1) {
      res :+= m
    }

    res.map(_.toInt)
  }

  val factor = Array.fill(n)(0L)
  for (i <- 2 to n) {
    for (f <- factorize(i)) {
      factor(f-1) += 1
    }
  }

  println(factor.map(_ + 1).reduceLeft(times))
}
