require'prime'
n=gets.to_i
f=(1..n).reduce(:*)
q=Prime.take_while{|x|x<=n}
p [*q.permutation(3).map{|x,y,z|x**2*y**4*z**4},
*q.permutation(2).map{|x,y,z|x**4*y**14},
*q.permutation(2).map{|x,y,z|x**2*y**24},
*q.map{|x|x**74}].sort.uniq.count{|x|f%x==0}