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())
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]
b=[0]*25
for i in range(1,n):
    m=i+1
    for j in a:
        while m%j==0:
            b[a.index(j)]+=1
            m//=j
sf=tf=ft=f=t=0
for i in b:
    if i>73:sf+=1
    if i>23:tf+=1
    if i>13:ft+=1
    if i>3:f+=1
    if i>1:t+=1
ans=sf
ans+=tf*(t-1)
ans+=ft*(f-1)
ans+=f*(f-1)*(t-2)//2
print(ans)