import Data.List

primeFactors 1 = []
primeFactors n =
    case factor of
        Just p -> p : primeFactors (n `div` p)
        Nothing -> []
    where factor = find (\x -> n `mod` x == 0) [2..n]

main = do
    n <- readLn
    let expos = map length $ group $ primeFactors $ product [1..n]
    let [a, b, c, d, e] = map (\m -> length $ filter (\e -> e >= m - 1) expos) [3, 5, 15, 25, 75]
    print $ e + d * (a - 1) + c * (b - 1) + b * (b - 1) * (a - 2) `div` 2