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
l =    [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]
ans = 0
l3, l5, l15, l25, l75 = 0, 0, 0, 0, 0
n = int(input())
for i in l:
  temp = n
  c = 1
  while temp >= i:
    temp //= i
    c += temp
  if c >= 3:
    l3 += 1
  if c >= 5:
    l5 += 1
  if c >= 15:
    l15 += 1
  if c >= 25:
    l25 += 1
  if c >= 75:
    l75 += 1
ans += l75
ans += l25 * (l3-1)
ans += l15 * (l5-1)
ans += (l3-2) * l5*(l5-1) // 2
print(ans)