require "prime"
#input of int(split by space)
def get_i()
  return gets.chomp.split(" ").map(&:to_i)
end
#input of float(split by space)
def get_f()
  return gets.chomp.split(" ").map(&:to_f)
end
#input of string(split by space)
def get()
  return gets.chomp.split(" ")
end
#input of string(split per one character)
def get_nsp()
  return gets.chomp.split("")
end
#yes or no decision
def yn_judge(bool,y="Yes",n="No")
  return bool ? y : n 
end
#create of array
def array(size1,init=nil,size2=-1)
  if size2==-1
    return Array.new(size1){init}
  else
    return Array.new(size2){Array.new(size1){init}}
  end
end

def max(a,b)
    return a>b ? a : b
end

def min(a,b)
    return a>b ? b : a
end

INF=Float::INFINITY

N=gets.to_i
kind=Hash.new(0)
2.upto(N) do|x|
  primes=Prime.prime_division(x)
  primes.each do|k,v|
    kind[k]+=v
  end
end
p3=0
p5=0
p15=0
p25=0
p75=0
kind.each do|k,v|
  p3+=1 if v>=2
  p5+=1 if v>=4
  p15+=1 if v>=14
  p25+=1 if v>=24
  p75+=1 if v>=74
end
puts p5*(p5-1)/2*(p3-2)+p25*(p3-1)+p75+p15*(p5-1)