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())
P = [1]*(N+1)
for i in range(1,N+1):
    n = i
    for j in range(2,N+1):
        while n%j==0:
            P[j]+=1
            n//=j
P = [p for p in P if p>1]
N = len(P)-1
cnt = 0
B = [1,3,5,15,25,75]
def f(k,d):
    global N,P,cnt,B
    if d==75:
        cnt += 1
        return
    elif d>75 or k>N:
        return
    for i in range(1,P[k]+1):
        if i in B:
            f(k+1,d*i)
f(0,1)
print(cnt)