require 'prime'

#組み合わせ（小さい数用）
def combi(n, m)
  return 1 if m == 0
  return n if m == 1
  return combi(n, n - m) if m > n - m
  fact_s(n, n - m + 1) / fact_s(m, 1)
end
#階乗（小さい数用）
def fact_s(n, m)
  (m..n).to_a.inject(&:*)
end

N = gets.to_i

pr = Hash.new{|h, k| h[k] = 0}
N.downto(2){|n|
  n.prime_division.each{|k, v|
    pr[k] += v
  }
}
ans = 0
cnt3 = pr.count{|k, v| v >= 2}
cnt5 = pr.count{|k, v| v >= 4}
cnt15= pr.count{|k, v| v >= 14}
cnt25= pr.count{|k, v| v >= 24}
cnt75= pr.count{|k, v| v >= 74}
ans += combi(cnt5, 2) * combi(cnt3-2, 1) if cnt5 > 1
ans += combi(cnt15, 1) * combi(cnt5-1, 1) if cnt15 > 0
ans += combi(cnt25, 1) * combi(cnt3-1, 1) if cnt25 > 0
ans += combi(cnt75, 1) if cnt75 > 0

puts ans
