import qualified Data.Vector.Unboxed as V
main=print.solve=<<readLn
solve n=g 4+g 3*(g 0-1)+g 2*(g 1-1)+(g 1*(g 1-1)`div`2)*(g 0-2)where
  g i=ks V.! i
  ks=V.fromList$map(\i->V.length$V.filter(>=i)vs)([2,4,14,24,74]::[Int])
  vs=V.accum(+)(V.replicate(n+1)0).(`zip`repeat 1)$concatMap(f 2)[2..n]
f k i
  |k*k>i=[i]
  |r==0=k:f k j
  |otherwise=f(k+1)i
  where(j,r)=divMod i k