require 'prime'

n = gets.to_i

h = {}

(2..n).each{|x| x.prime_division.each{|x,y| h[x] ||= 0; h[x] += y}}

r = 0

(2..n).each do |i|
  next unless h[i]
  (i+1..n).each do |j|
    next unless h[j]
    (j+1..n).each do |k|
      next unless h[k]
      r += 1 if h[i] >= 2 && h[j] >= 4 && h[k] >= 4
      r += 1 if h[i] >= 4 && h[j] >= 2 && h[k] >= 4
      r += 1 if h[i] >= 4 && h[j] >= 4 && h[k] >= 2
    end
  end
end

(2..n).each do |i|
  next unless h[i]
  (i+1..n).each do |j|
    next unless h[j]
    r += 1 if h[i] >= 14 && h[j] >= 4
    r += 1 if h[i] >= 4 && h[j] >= 14

    r += 1 if h[i] >= 24 && h[j] >= 2
    r += 1 if h[i] >= 2 && h[j] >= 24
  end
end

(2..n).each do |i|
  next unless h[i]
  r += 1 if h[i] >= 74
end

puts r
