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
primes = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]
c = {3:0, 5:0, 15:0, 25:0, 75:0}
n = int(input())
for p in primes:
  r = n//p
  a = 0
  while r>0:
    a += r
    r //= p
  for x in c.keys():
    if x-1 <= a:
      c[x] += 1
print(c[75]+c[25]*(c[3]-1)+c[15]*(c[5]-1)+c[5]*(c[5]-1)*(c[3]-2)//2)