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 copy

def fact(n,s):
    return len(list(filter(lambda x:x>=n-1,s)))


n=int(input())
s=[0]*(n+1)
for i in range(2,n+1):
    a=copy.deepcopy(i)
    for j in range(2,a+1):
        while a%j==0:
            s[j]+=1
            a//=j
#print(s)
b=fact(5,s)
print(max(0,fact(75,s)+fact(25,s)*(fact(3,s)-1)+fact(15,s)*(fact(5,s)-1)+b*(b-1)*(fact(3,s)-2)//2))