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())
e = [0]*101

for n in range(2, N+1):
    cur = n
    for i in range(2, n+1):
        while cur%i==0:
            e[i]+=1
            cur //= i

ans = 0
ov74, ov24, ov14, ov4, ov2 = 0,0,0,0,0
for ei in e:
    if ei>=2: ov2 += 1
    if ei>=4: ov4 += 1
    if ei>=14: ov14 += 1
    if ei>=24: ov24 += 1
    if ei>=74: ov74 += 1

ans += ov24*(ov2-1)
ans += ov4*(ov4-1)*(ov2-2)//2
ans += ov14*(ov4-1)
ans += ov74
# print(e)
print(ans)