import Data.List

main = do
  n <- readLn :: IO Int
  print $ if n == 1 then 1 else (cnt $ concat $ [factorize x | x<-[1..n]])

factorize :: Int -> [Int]
factorize 1 = []
factorize n = 
  let 
    [m] = take 1 [i | i <-[2..], n `mod` i == 0]
  in 
    m : (factorize $ n `div` m)
  
cnt :: [Int] -> Int
cnt [] = 0
cnt xs = foldl1' (\a b -> a*b `mod` (10^9+7)) . map ((+1) . length) . group $ sort xs