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
q=[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]
N=int(input())
p={}
for i in range(N):
 n=i+1
 for j in range(25):
  if n==1 or n<q[j]:break
  while n%q[j]==0:p[q[j]]=1if q[j]not in p.keys()else p[q[j]]+1;n//=q[j]
n=[1,3,13,23,73]
m=[len([v for v in p.values()if v>k])for k in n]
print(m[1]*~-m[1]//2*(m[0]-2)+m[3]*~-m[0]+m[2]*~-m[1]+m[4])