local n = io.read("*n")
local divp = {}
for i = 2, n do
  for j = 2, i do
    if i % j == 0 then
      if not divp[j] then divp[j] = 0 end
      while i % j == 0 do
        divp[j] = divp[j] + 1
        i = i // j
      end
    end
  end
end
local t = {}
for k, v in pairs(divp) do
  table.insert(t, v)
end
table.sort(t, function(x, y) return x > y end)
local p3, p5, p15, p25, p75 = 0, 0, 0, 0, 0
for i = 1, #t do
  if 2 <= t[i] then p3 = i end
  if 4 <= t[i] then p5 = i end
  if 14 <= t[i] then p15 = i end
  if 24 <= t[i] then p25 = i end
  if 74 <= t[i] then p75 = i end
end
local ret = 0
-- 75
ret = ret + p75
-- 25 * 3
ret = ret + p25 * (p3 - 1)
-- 15 * 5
ret = ret + p15 * (p5 - 1)
-- 5 * 5 * 3
ret = ret + p5 * (p5 - 1) // 2 * (p3 - 2)
print(ret)
