require 'prime'
N = gets.to_i
prime_division = Prime.prime_division((1..N).reduce { |acc, n| acc * n })
el = prime_division.map { |_, v| v }
def e_gt_n(el, n)
  el.count { |e| e >= n }
end
answer = (
  e_gt_n(el, 74) +
  e_gt_n(el, 24) * (e_gt_n(el, 2) - 1) +
  e_gt_n(el, 14) * (e_gt_n(el, 4) - 1) +
  e_gt_n(el, 4) * (e_gt_n(el, 4) - 1) * (e_gt_n(el, 2) - 2) / 2
)
puts answer
