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
def solve(n):
    p = {}
    for m in range(1,n+1):
        for q in range(2,m+1):
            while m % q == 0:
                if not q in p:
                    p[q] = 0
                p[q] += 1
                m /= q
    S = set()
    # 5 x 5 x 3
    for k1, v1 in p.items():
        for k2, v2 in p.items():
            for k3, v3 in p.items():
                if (v1 >= 2) and (v2 >= 4) and (v3 >= 4) and (k1 != k2) and (k2 != k3) and (k1 != k3):
                    S.add((k1**2) * (k2**4) * (k3**4))
    # 25 x 3
    for k1, v1 in p.items():
        for k2, v2 in p.items():
            if (v1 >= 24) and (v2 >= 2) and (k1 != k2):
                S.add((k1**24) * (k2**2))
    # 15 x 5
    for k1, v1 in p.items():
        for k2, v2 in p.items():
            if (v1 >= 14) and (v2 >= 4) and (k1 != k2):
                S.add((k1**14) * (k2**4))
    # 75
    for k1, v1 in p.items():
        if (v1 >= 74):
            S.add(v1**74)
    return len(S)
print solve(input())