import Data.List

factors n = [x | x <- [1..n], n `mod` x == 0]

factorization 1 = []
factorization x = v : factorization (x `div` v)
  where
      v = (factors x) !! 1

count [] xs rs = rs
count (n:ns) xs rs = count ns xs $ ((length (filter (\x -> x == n) xs)) + 1) : rs

main = do
  line <- getLine
  let n = (read :: String -> Int) line
      xs = concat $ fmap factorization [2..n] in
    print . show $ foldr (\x y -> (x * y) `mod` 1000000007) 1 $ count (nub xs) xs []
