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=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97]
D=dict()
for p in P:
  count=0
  order=1
  while p**order<=n:
    count+=n//(p**order)
    order+=1
  D[p]=count
List=[0 for i in range(5)]
for p in P:
  if D[p]>=74:
    List[4]+=1
  elif D[p]>=24:
    List[3]+=1
  elif D[p]>=14:
    List[2]+=1
  elif D[p]>=4:
    List[1]+=1
  elif D[p]>=2:
    List[0]+=1
for i in range(4):
  List[3-i]+=List[4-i]
print(List[4]+(List[0]-1)*List[3]+(List[1]-1)*List[2]+(List[0]-2)*List[1]*(List[1]-1)//2)