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())
p_dict = {2:1, 3:1}
for num in range(4,N+1):
  is_prime = True
  for prime, cnt in p_dict.items():
    if num%prime == 0:
      p_dict[prime] = cnt + 1
      idx = 2
      while num%(prime**idx) == 0:
        idx += 1
        p_dict[prime] += 1
      is_prime = False
  if is_prime:
    p_dict[num] = 1

def num(n):
  return len(list(filter(lambda x:x >= n-1, p_dict.values())))

ans = num(75) + num(25) * (num(3)-1) + num(15) * (num(5)-1) + (num(5) * (num(5)-1) * (num(3)-2))//2
print(ans)


  