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())

# 素因数分解
def factorization( n, e ):
    for i in range( 2, N+1 ):
        for j in range( 2, i+1 ):
            while i % j == 0:
                e[j] += 1
                i /= j

# e の要素のうち m-1 以上のものの個数
def num( m ):
    return len( list(filter(lambda x: x>= m-1, e)) )


e = [0]*(N+1)
factorization( N, e )
ans = num(75) + num(25)*(num(3)-1) + num(15)*(num(5)-1) \
      + num(5)*(num(5)-1)*(num(3)-2)//2
print( ans )