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())
primes = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]

two = sum(p<=N//2 for p in primes) # 2
four = sum(p<=N//4 for p in primes) if N>=12 else sum([N>=9, N>=6]) # 4
ft = sum([N>=91, N>=60, N>=30, N>=16]) # 14
tf = sum([N>=100, N>=54, N>=28]) # 24
sf = N>=78 # 74

tff = four * (four-1) * (two-2) // 2 # 2,4,4
ttf = tf * (two-1) # 2,24
fft = ft * (four-1) # 4,14
sfo = sf # 74

print(tff+ttf+fft+sfo)