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
# 75=3*5*5
# N=a^2*b^4*c^4 | a^14+b^4 | a^24*b^2 | a^74
n=int(input())

cntDiviser=[0 for _ in range(n+1)]
for i in range(2,n+1):
    tmp=i
    for j in range(2,i+1):
        while tmp%j==0:
            cntDiviser[j]+=1
            tmp//=j # //整数の商

def num(m):
    return len(list(filter(lambda x:x>=m,cntDiviser)))

print(
    num(74)
    +num(24)*(num(2)-1)
    +num(14)*(num(4)-1)
    +num(4)*(num(4)-1)*(num(2)-2)//2 # 4,4,2の組み合わせの数
    )
