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 find_prime(n):
    e = [0] * (n + 1)
    for tmp in range(2, n + 1):
        i = 2
        while(tmp != 1):
            if tmp % i == 0:
                tmp //= i
                e[i] += 1
            else:
                i += 1

    return(e)


def num(i):
    return len(list(filter(lambda x: x >= i, e)))


n = int(input())

e = find_prime(n)
# print(e)

print(num(74) + num(24) * (num(2) - 1) + num(14) * (num(4) - 1)
      + num(4) * (num(4) - 1) * (num(2) - 2) // 2)