def prime_factorization(n)
  s = Math.sqrt(n).floor
  primes = Hash.new { |h, k| h[k] = 0 }
  while n % 2 == 0
    primes[2] += 1
    n /= 2
  end

  3.step(s, 2) do |i|
    while n % i == 0
      primes[i] += 1
      n /= i
    end

    break if n == 1
  end

  primes[n] = 1 if s < n
  primes
end

n = gets.to_i
x = 1
2.upto(n) { |i| x *= i }
primes = prime_factorization(x)
ans = 0
comb = [1]
primes.each_value do |cnt|
  next_comb = []
  1.upto(cnt + 1) do |c1|
    comb.each do |c2|
      c3 = c1 * c2
      if c3 == 75
        ans += 1
      elsif c3 < 75
        next_comb << c3
      end
    end
  end
  comb = next_comb
end
puts ans
