import qualified Data.IntMap as Map
type Primes = Map.IntMap Integer

main :: IO ()
main = do
    n <- readLn
    print $ solve n

solve :: Integer -> Integer
solve n = a `mod` b
    where
        a = Map.fold (*) 1 ps'
        b = 10^(9::Integer)+7
        ps = primes $ product [1..n]
        ps' = Map.map (+1) ps

primes :: Integer -> Primes
primes 1 = Map.empty
primes n = Map.unionWith (+) p1 (primes n')
    where
        v = factor1 n
        p1 = Map.singleton (fromInteger v) 1
        n' = n `div` v

factor1 :: Integer -> Integer
factor1 n = head ks
    where ks = [x | x <- 2:[3,5..], n `mod` x == 0]
