require 'prime'
n = gets.chomp.to_i

def fact(n)
  return 1 if n <= 1
  n * fact(n-1)
end

def num_div(d, divs)
  num_divs = []
  begin
    divs.each_index { |i| num_divs.push(d.select { |e| e >= divs[i] - 1 }.size - i) }
    if divs == [5, 5, 3]
      num_divs.reduce(1) { |mul, e| mul * e } / 2
    else
      num_divs.reduce(1) { |mul, e| mul * e }
    end
  rescue NoMethodError
    0
  end
end

f = fact(n)
count = 0
d = f.prime_division.map { |e| e.last }
[[75], [25, 3], [15, 5], [5, 5, 3]].each do |divs|
  n = num_div(d, divs)
  count += n
end
puts count
