require 'prime'

N = gets.to_i

pows = []
0.upto(75) do |i|
  0.upto(75) do |j|
    0.upto(75) do |k|
      pows << [i - 1, j - 1, k - 1].select(&:positive?).sort.reverse if i * j * k == 75
    end
  end
end
pows.uniq!

n_primes = Array.new(N + 1, 0)
2.upto(N) do |n|
  n.prime_division.each do |pd|
    n_primes[pd[0]] += pd[1]
  end
end
n_primes.select! { |n| n >= 2 }

ans = pows.inject(0) do |ans, pow_nums|
  a = n_primes.count { |n| n >= pow_nums[0] }
  a *= n_primes.count { |n| n >= pow_nums[1] } - 1 if pow_nums[1]
  a = a * (n_primes.count { |n| n >= pow_nums[2] } - 2) / 2 if pow_nums[2]
  ans + a
end

puts ans