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())
s_list = [[5, 5, 3], [25, 3], [15, 5], [75]]

a = [0 for i in range(N+1)]
for i in range(2, N+1):
    for j in range(2, N+1):
       while i%j==0:
           a[j]+=1 
           i/=j

def div_c(n):
    return len(list(filter(lambda x: x >= n-1, a))) 
    
ans=0
for s in s_list:
    i=0
    c=1
    for t in s:
        c*=(div_c(t)-i)
        i+=1
    ans+=int(c/(len(s)-len(set(s))+1))

       
print(ans)
        