N = gets.to_i

pf = [0] * (N + 1)
2.upto(N) do |m|
  2.upto(m) do |i|
    next if m == 1
    while m % i == 0
      m /= i
      pf[i] += 1
    end
  end
end

a = pf.count{|k| k >= 74}
b = pf.count{|k| k >= 24}
c = pf.count{|k| k >= 14}
d = pf.count{|k| k >= 4}
e = pf.count{|k| k >= 2}

p a + b * (e - 1) + c * (d - 1) + d * (d - 1) / 2 * (e - 2)