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())
N=1
for i in range(n):
    N*=(i+1)
a=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97]
l=[0 for i in range(len(a))]
k=0
for i in a:
    tmp=N
    while True:
        if tmp%i==0:
            l[k]+=1
            tmp=tmp//i
        else:
            k+=1
            break
up74=len([i for i in l if i>=74])
up24=len([i for i in l if i>=24])
up14=len([i for i in l if i>=14])
up4=len([i for i in l if i>=4])
up2=len([i for i in l if i>=2])
print(up74+up24*(up2-1)+up14*(up4-1)+up4*(up4-1)//2*(up2-2))