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
#114_D
N=int(input())
prime=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]

def Count(x):
    res=0
    tmp=N
    while tmp//x:
        tmp=tmp//x
        res+=tmp
    return res

cnt=[Count(p) for p in prime]

def Sum(n):
    return sum([x>=n for x in cnt])

Ans=0
Ans=Sum(74)+Sum(24)*(Sum(2)-1)+Sum(14)*(Sum(4)-1)+Sum(4)*(Sum(4)-1)*(Sum(2)-2)//2
print(Ans)