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())

e=[0]*(N+1)

for i in range(N+1):
    cur=i

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

def num(m):
    tmp=0
    for i in range(N+1):
        if e[i]>=m:
            tmp+=1
    return tmp

print(num(74)+num(24)*(num(2)-1)+num(4)*(num(4)-1)*(num(2)-2)//2+num(14)*(num(4)-1))