require 'prime'

def factorial(n)
  return 1 if n == 0
  (1..n).inject(1,:*)
end

def nCk(n, k)
  factorial(n) / (factorial(k) * factorial(n - k))
end

n = gets.to_i
factors = factorial(n).prime_division
ans = 0
n1 = factors.size
n3, n5, n15, n25, n75 = 0, 0, 0, 0, 0
factors.each do |f|
  n3 += 1 if f[1] >= 2
  n5 += 1 if f[1] >= 4
  n15 += 1 if f[1] >= 14
  n25 += 1 if f[1] >= 24
  n75 += 1 if f[1] >= 74
end
ans += nCk(n1, (n1 - 75)) if n1 >= 75
ans += (n3 - n5) * ((n5 * (n5 - 1)) / 2) + ((n5 * (n5 - 1) * (n5 - 2)) / 6) * 3 if n3 >= 3 && n5 >= 2
ans += (n5 - n15) * n15 + (n15 * (n15 - 1)) if n5 >= 2 && n15 >= 1
ans += (n3 - n25) * n25 + (n25 * (n25 - 1)) if n3 >= 2 && n25 >= 1
ans += n75
puts ans
