primes :: [Int]
primes = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97]

log':: Int -> Int -> Int
log' b n = fst $ helper (0, n)
  where helper (i, n') = if n' `mod` b == 0
                         then helper (i + 1, n' `div` b)
                         else (i, n')

factoring :: Int -> [Int]
factoring n = map (`log'` n) primes

count :: [Int] -> Int
count fs =
  let g2s = length $ filter (2 <=) fs
      g4s = length $ filter (4 <=) fs
      g14s = length $ filter (14 <=) fs
      g24s = length $ filter (24 <=) fs
      g74s = length $ filter (74 <=) fs
  in g74s +
     g24s * (g2s - 1) +
     g14s * (g4s - 1) +
     g4s * (g4s - 1) * (g2s - 2) `div` 2

main = do
  n <- read <$> getLine :: IO Int
  let fs = foldr1 (zipWith (+)) $ map factoring [1..n]
  print $ count fs
