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)
1.upto(N) do|i|
  a=Prime.prime_division(i)
  a.each do|k,v|
    kind[k]+=v
  end
end
kind=kind.sort{|x,y| y[1]<=>x[1]}
res=Hash.new
#75=75 | 3*25 | 3*5*5 | 15*5 
res[3-1]=0
res[5-1]=0
res[15-1]=0
res[25-1]=0
res[75-1]=0
num=[3-1,5-1,15-1,25-1,75-1]
kind.each do|k,v|
  num.each do|x|
    break if v<x
    res[x]+=1
  end 
end
puts res[75-1]+(res[3-1]-1)*res[25-1]+(res[3-1]-2)*(res[5-1]-1)*(res[5-1])/2+res[15-1]*(res[5-1]-1)