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
p=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]
a=[0 for i in range(len(p))]

n= int(input())
for i in range(n):
  m=i+1
  for j in range(len(p)):
    while m%p[j]==0:
      a[j]+=1
      m=m/p[j]

x=0;y=0;z=0;w=0;u=0
for i in range(len(a)):
  if a[i]>=74:
    x+=1
  if a[i]>=24:
    y+=1
  if a[i]>=14:
    z+=1
  if a[i]>=4:
    w+=1
  if a[i]>=2:
    u+=1
print(int(x+y*(u-1)+z*(w-1)+w*(w-1)/2*(u-2)))