import Control.Monad

main = do
    n <- readLn :: IO Int
    let 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]
    let factors = do
        p <- primes
        let hoge = do 
            ni <- [2..n]
            return $ getFactNum p ni
        return $ sum hoge
        -- sum map getFactNum p [2..n]  
    --print $ factors
    -- 2_4_4
    let a = length $ filter (\x -> x >= 2 && x < 4) factors 
    let b = length $ filter (\x -> x >= 4) factors 
    -- 4_14
    let c = length $ filter (\x -> x >= 4 && x < 14) factors 
    let d = length $ filter (\x -> x >= 14) factors 
    -- 2_24
    let e = length $ filter (\x -> x >= 2 && x < 24) factors 
    let f = length $ filter (\x -> x >= 24) factors 
    -- 74
    let g = length $ filter (\x -> x >= 74) factors 
    print $ a*b*(b-1) `div` 2 + b*(b-1)*(b-2) `div` 2 +  c*d + d*(d-1) + e*f + f*(f-1) + g


getFactNum :: Int -> Int -> Int
getFactNum p ni 
    | amari == 0 =  getFactNum p (ni `div` p) + 1
    | otherwise = 0
    where amari = ni `mod` p