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
import sys
from collections import deque
import copy
import math
def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline

def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [N] = [long(input_raw[0])]
    prim_dict = {}

    for i in range(2, N + 1):
        p = 2
        X = i
        for p in range(2, i + 1):
            while X % p == 0:
                if p not in prim_dict:
                    prim_dict[p] = 2
                else:
                    prim_dict[p] += 1
                X /= p
    count_3over = 0
    count_5over = 0
    count_15over = 0
    count_25over = 0
    count_75over = 0
    for p in prim_dict:
        if prim_dict[p] >= 75:
            count_75over += 1L
        if prim_dict[p] >= 25:
            count_25over += 1L
        if prim_dict[p] >= 15:
            count_15over += 1L
        if prim_dict[p] >= 5:
            count_5over += 1L
        if prim_dict[p] >= 3:
            count_3over += 1L

    count = 0L
    #3,3,5
    count += (count_5over * (count_5over-1))/2 * (count_3over - 2)
    count += count_15over * (count_5over - 1)
    count += count_25over * (count_3over - 1)
    count += count_75over
    print count


if __name__ == '__main__':
    main()
