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=[0 for i in range(n+1)]
for i in range(2,n+1):
    t=2
    a=i
    while t<=10:
        if(a%t==0):
            p[t]+=1
            a//=t
        else:
            t+=1
    p[a]+=1
d={2:0,4:0,14:0,24:0,74:0}
for i in p[2:]:
    if(i>=2):
        d[2]+=1
    if(i>=4):
        d[4]+=1
    if(i>=14):
        d[14]+=1
    if(i>=24):
        d[24]+=1
    if(i>=74):
        d[74]+=1
print((d[2]-2)*d[4]*(d[4]-1)//2+(d[4]-1)*d[14]+(d[2]-1)*d[24]+d[74])