require 'prime'

def comb(n, r)
  r = [r, n - r].min
  return 1 if r == 0

  (n - r + 1).upto(n).inject(:*) / 1.upto(r).inject(:*)
end

n = gets.to_i
h = Hash.new(0)

2.upto(n) do |i|
  i.prime_division.each { |p, e| h[p] += e }
end

ans = h.count { |_k, v| 74 <= v }

x = h.count { |_k, v| 24 <= v }
y = h.count { |_k, v| 2 <= v && v < 24 }
ans += x * (x - 1) + x * y

x = h.count { |_k, v| 14 <= v }
y = h.count { |_k, v| 4 <= v && v < 14 }
ans += x * (x - 1) + x * y

x = h.count { |_k, v| 4 <= v }
y = h.count { |_k, v| 2 <= v && v < 4 }

if x >= 3
  ans += comb(x, 3) * 3 + comb(x, 2) * y
else
  ans += x == 2 ? y : 0
end

puts ans
