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
def f(p,N):
    res=0
    while N>=p:
        N//=p
        res+=N
    return res

N=int(input())
ps=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]
A=[len([p for p in ps if f(p,N)>=k]) for k in [2,4,14,24,74]]

a,b,c,d,e=A[0],A[1],A[2],A[3],A[4]

ans=0
# 3*5^2
ans+=b*(b-1)//2*(a-2)
# 3*25
ans+=d*(a-1)
# 5*15
ans+=c*(b-1)
# 75
ans+=e

print(ans)