import Data.Int

fact :: Integral a => a -> a
fact n = f n 1
  where
    f 0 b = b
    f a b = b `seq` f (a - 1) (a * b)

divisor :: Integral a => a -> [a]
divisor n = foldr f [] $ takeWhile ((<= n) . (^2)) [1..n]
  where
    f x xs
        | r == 0, q /= x = x : q : xs
        | r == 0         = x : xs
        | otherwise      = xs
      where
        (q, r) = n `divMod` x

modulus :: Int64
modulus = 10^9 + 7

main :: IO ()
main = do
    n <- readLn :: IO Int
    print . (`mod` modulus) . fromIntegral . length . divisor $ fact n