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
import math

N = int(input())
pn = [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]

C3 = 0
C5 = 0
C15 = 0
C25 = 0
C75 = 0

for i in pn:
    if math.factorial(N) % pow(i,2) == 0:
        C3 += 1
    if math.factorial(N) % pow(i,4) == 0:
        C5 += 1
    if math.factorial(N) % pow(i,14) == 0:
        C15 += 1
    if math.factorial(N) % pow(i,24) == 0:
        C25 += 1
    if math.factorial(N) % pow(i,74) == 0:
        C75 += 1

ans = (C3-2)*C5*(C5-1)//2 + (C5-1)*C15 + (C3-1)*C25 + C75 
print(ans)