local mfl, mce, msq = math.floor, math.ceil, math.sqrt
local n = io.read("*n")

local function getprimes(x)
  local primes = {}
  local allnums = {}
  for i = 1, x do allnums[i] = true end
  for i = 2, x do
    if(allnums[i]) then
      table.insert(primes, i)
      local lim = mfl(x / i)
      for j = 2, lim do
        allnums[j * i] = false
      end
    end
  end
  return primes
end

local primes = getprimes(47)
local t = {}
for i = 1, 47 do
  t[i] = 0
end
for i = 1, #primes do
  local p = primes[i]
  local ctot = 0
  local c = mfl(n / p)
  while 0 < c do
    ctot = ctot + c
    c = mfl(c / p)
  end
  t[p] = ctot
end

local ov74, ov24, ov14, ov4, ov2 = 0, 0, 0, 0, 0
for i = 1, 47 do
  if 74 <= t[i] then ov74 = ov74 + 1 end
  if 24 <= t[i] then ov24 = ov24 + 1 end
  if 14 <= t[i] then ov14 = ov14 + 1 end
  if 4 <= t[i] then ov4 = ov4 + 1 end
  if 2 <= t[i] then ov2 = ov2 + 1 end
end
local ret = ov74 + ov24 * (ov2 - 1) + ov14 * (ov4 - 1) + mfl(ov4 * (ov4 - 1) / 2) * (ov2 - 2)
print(ret)
