def prime_factor(n)
  prime = []
  2.upto(n) do |i|
    break unless i <= n / i
    while (n % i).zero?
      prime << i
      n /= i
    end
  end
  prime << n unless n == 1
  prime
end

N = gets.to_i
M = 75

d = Hash.new{|h,k|h[k]=0}
1.upto(N){|i| prime_factor(i).each{|p| d[p] += 1}}

dp = Array.new(M+2){0}
dp[1] = 1
d.each do |k, v|
  nex = Array.new(M+2){0}
  1.upto(M) do |i|
    nex[i] += dp[i]
    1.upto(v) do |j|
      nex[[i*(j+1), M+1].min] += dp[i]
    end
  end
  dp = nex
end
p dp[M]
