require 'prime'

def f(n,ps)
	res=[]
	m=n
	ps.each{|p|
		c=0
		while (n%p==0) 
			n=n/p
			c+=1
		end
		if(c>0)
			$arr[p]+=c
		end
	}
	res
end

def f2(p,m,c)

	if m>75 || c>3 then
		0
	elsif m==75
		1
	elsif p>=$ps.size
		0
	elsif $ps[p]>50
		0
	else
		res=0
		[2,4,14,24,74].each{|e|
			if $arr[$ps[p]]>=e then
				res+=f2(p+1,m*(e+1),c+1)
			end
		}
		res+=f2(p+1,m,c)
		res
	end
end

n=gets.to_i
$ps=Prime.each(n).to_a
$arr=Hash.new(0)

(2..n).each{|e|
	f(e,$ps)
}
if (n<2) then
	puts 0
else
	puts f2(0,1,0)
end