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(string):
    n = int(string)
    d = [0] * (n + 1)
    for i in range(2, n + 1):
        t = i
        for j in range(2, i + 1):
            while t % j == 0:
                d[j] += 1
                t //= j

    def f(n):
        return len(list(filter(lambda x: x >= n - 1, d)))

    f3, f5 = f(3), f(5)
    return str(f(75) + f(25) * (f3 - 1) + f(15) * (f5 - 1) + f5 * (f5 - 1) // 2 * (f3 - 2))


if __name__ == '__main__':
    print(solve(input()))
