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
import math
n=int(input())
ans=0
tmp=[0 for i in range(n+1)]
for i in range(2,n+1):
    now=i
    for j in range(2,n+1):
        while now%j==0:
            tmp[j]+=1
            now//=j
def solve(x):
    tmp1=len(list(filter(lambda y:y>=x-1,tmp)))
    return tmp1
print(solve(75)+solve(25)*(solve(3)-1)+solve(15)*(solve(5)-1)+
solve(5)*(solve(5)-1)*(solve(3)-2)//2)
