require 'prime'

N = gets.to_i

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

primes = Array.new(N + 1, 0)
2.upto(N) do |n|
  dn = n
  2.upto(n) do |i|
    break if dn < i
    next if !i.prime?
    dn % i != 0
    while dn % i == 0
      primes[i] += 1
      dn /= i
    end
  end
end
primes.select! { |n| n >= 2 }

ans = 0
cb.each do |cbc|
  cbc.sort!
  primes.combination(cbc.size).each do |primes|
    primes.sort!
    hit = true
    primes.each_with_index do |prime, i|
      if cbc[i] > prime
        hit = false
        break
      end
    end
    if hit
      ans += 1
      # p cbc
    end
  end
end

puts ans