require 'prime'
N = gets.chomp.to_i
M = 75

#N!を素因数分解する
hash = Hash.new(0)
(2..N).each do |i|
    Prime.prime_division(i).each do |pr, n|
        hash[pr] += n
    end
end

nums = hash.values
len = nums.length

#Mの約数列挙
divs = []
for i in 1..M do
  if M%i == 0
    divs << i
  end
end


#dp[i][j]：i番目の素因数まで用いてつくるとき，約数がj個となる場合の数
dp = Array.new(len+1){Array.new(M+1, 0)}
dp[0][1] = 1
len.times do |i|
    divs.each do |d1|
        divs.each do |d2|
            next if d1*d2 > M
            if nums[i]+1 >= d2
                dp[i+1][d1*d2] += dp[i][d1]
            end
        end
    end
end

puts dp[len][M]
