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
  
  count = 0
  for i in 0..n
    for j in (i+1)..n
      for k in 0..n
        next if i == k || j == k
        count += 1 if b[i] >= 4 && b[j] >= 4 && b[k] >= 2
      end
      count += 1 if b[i] >= 14 && b[j] >= 4
      count += 1 if b[i] >= 24 && b[j] >= 2
    end
    count += 1 if b[i] >= 74
  end
  
  return count
end


puts solve(gets.to_i)

