import Control.Applicative
import Control.Monad
import Data.List

factors m = sub m (2:[3,5..])
  where
    sub 1 _ = []
    sub n pa@(p:ps)
      | q < p = [n]
      | r == 0 = p : sub q pa
      | otherwise = sub n ps
      where
        (q, r) = divMod n p

ffc m = map length $ group $ sort $ concat $ map factors [1..m]

solve n =
    lenn 74 + 
    lenn 24 * (lenn 2 - 1) +
    lenn 14 * (lenn 4 - 1) + 
    lenn 4 * (lenn 4 - 1) * (lenn 2 - 2) `div` 2
  where
    fc = ffc n
    lenn t = length $ takeWhile (>=t) fc

main = readLn >>= print . solve