def num(m, b)
  return b.select{|i| i >= m}.length
end

def solve(n)
  a= Array.new(n+1, 1)
  for i in 2..n
    if a[i] == 1
      for j in ((i*2)..n).step(i)
        a[j] = 0
      end
    end
  end
  prime = []
  a.each.with_index do |v, index|
    prime.push(index) if v != 0 && index >= 2
  end

  b= Array.new(n+1, 0)
  for i in 2..n
    if a[i] == 1
      a[i] = 0
      j = i
      while j < n
        b[i] += n / j
        j *= i
      end
    end
  end
  
  return num(74, b) + num(24, b) * (num(2, b) - 1) + num(14, b) * (num(4, b) - 1) + num(4, b) * (num(4 , b) - 1) * (num(2, b) - 2) / 2
end


puts solve(gets.to_i)

