input = gets.to_i

if input == 1
  puts 0
  exit
end

require 'prime'

prime_division_list = (2..input).map do |i|
  h = i.prime_division.to_h
  a = [2,3,5,7].map do |p|
    h.delete(p).to_i
  end
  if h.length == 0 then a else nil end
end.compact

r = (1..prime_division_list.length).map do |i|
  prime_division_list.combination(i).select do |c|
    [
      [0,0,0,74],
      [0,0,2,24],
      [0,0,4,14],
      [0,2,4,4],
    ].include?([0,0,0,0].zip(*c).map(&:sum).sort)
  end.length
end.sum

puts r
