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())
primelist=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]
ll=[0,0,0,0,0]
for i in range(len(primelist)):
  a=primelist[i]
  t=n
  po=0
  while(t>0):
    t=int(t/a)
    po+=t
  if(po>=74):
    ll[4]+=1
  if(po>=24):
    ll[3]+=1
  if(po>=14):
    ll[2]+=1
  if(po>=4):
    ll[1]+=1
  if(po>=2):
    ll[0]+=1
ans=ll[4]+(ll[3])*(ll[0]-1)+(ll[2])*(ll[1]-1)+(ll[1])*(ll[1]-1)*(ll[0]-2)/2
print(int(ans))
    