N = readline.chomp.to_i

require 'prime'

merged = {}
(1..N).to_a.each do |n|
  ps = Hash[Prime.prime_division(n)]
  ps.each {|k,v| merged[k] = (merged[k] || 0) + v }
end

exps = merged.values.sort

# count 75
c1 = exps.count {|x| x >= 74}

# count 25 x 3
n25 = exps.count {|x| x >= 24}
n3 = exps.count {|x| x >= 2}
c2 = n25 * (n3-1)

# count 15 x 5
n15 = exps.count {|x| x >= 14}
n5 = exps.count {|x| x >= 4}
c3 = n15 * (n5-1)

# count 5 x 5 x 3
n5 = exps.count {|x| x >= 4}
n3 = exps.count {|x| x >= 2}
c4 = n5*(n5-1)/2 * (n3-2)

puts c1+c2+c3+c4
