You are given an integer N. Among the divisors of N! (= 1 \times 2 \times ... \times N), how many Shichi-Go numbers (literally "Seven-Five numbers") are there?

Here, a Shichi-Go number is a positive integer that has exactly 75 divisors.

Constraints

* 1 \leq N \leq 100
* N is an integer.

Input

Input is given from Standard Input in the following format:


N


Output

Print the number of the Shichi-Go numbers that are divisors of N!.

Examples

Input

9


Output

0


Input

10


Output

1


Input

100


Output

543
from collections import defaultdict

N=input()

Parts=defaultdict(lambda: 0)

for i in range(1,N+1):
	num_sqrt=int(i**0.5)+2

	for n in range(2,num_sqrt):
		while i%n==0:
			i/=n
			Parts[n]+=1
	else:
		if i!=1:
			Parts[i]+=1


C=defaultdict(lambda: set()) 
for val,cnt in  Parts.items():
	#print val,cnt
	if 0<=cnt: C[1].add(val)
	if 2<=cnt: C[3].add(val)
	if 4<=cnt: C[5].add(val)
	if 14<=cnt: C[15].add(val)
	if 24<=cnt: C[25].add(val)
	if 74<=cnt: C[75].add(val)

ans=0
#25,3
for x in C[25]:
	for y in C[3]:
		if x!=y:	ans+=1

#15,5
for x in C[15]:
	for y in C[5]:
		if x!=y:	ans+=1

#5,5,3
for x in C[5]:
	for y in C[5]:
		for z in C[3]:
			if x<y and x!=z and y!=z:	ans+=1

#75
ans+=len(C[75])

print ans