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
n=int(input())
prime=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]
elecnt=[0]*len(prime)
for i in range(len(prime)):
  c=1
  while n>prime[i]**c:
    elecnt[i]+=n//(prime[i]**c)
    c+=1
above74=sum(1 for i in elecnt if i>=74)
above24=sum(1 for i in elecnt if i>=24)
above14=sum(1 for i in elecnt if i>=14)
above4=sum(1 for i in elecnt if i>=4)
above2=sum(1 for i in elecnt if i>=2)
print(above74+above24*(above2-1)+above14*(above4-1)+above4*(above4-1)*(above2-2)//2)