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
A=int(input())
dict_f={}
def divisor(N):
   l={}
   for i in range(2,N+1):
      cnt=0
      while N%i==0:
         cnt+=1
         N//=i
      if cnt>0:
         l[i]=cnt
   return l
for i in range(2,A+1):
   D=divisor(i).items()
   for j,k in D:
      try:
         dict_f[j]=dict_f[j]+k
      except KeyError:
         dict_f[j]=k
dict_f=dict_f.values()
def num(N):
   return len(list(filter(lambda x: x >= N-1, dict_f)))
print(num(75)+num(25)*(num(3)-1)+num(15)*(num(5)-1)+num(5)*(num(5)-1)*(num(3)-2)//2)