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 java.util.*;

class Main{
	public static void main(String[] $){
		Scanner s=new Scanner(System.in);
		int n=s.nextInt();
		int[] p={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97},d=new int[25];
		for(int i=2;i<=n;++i){
			int I=i;
			for(int j=0;j<25;++j){
				while(I%p[j]==0){
					I/=p[j];
					++d[j];
				}
			}
		}

		int r=0;
		for(int i=0;i<25;++i){
			if(d[i]>=74)
				++r;
			for(int j=0;j<25;++j){
				if(i==j)
					continue;
				if(d[i]>=2&&d[j]>=24)
					++r;
				if(d[i]>=4&&d[j]>=14)
					++r;
				for(int k=j+1;k<25;++k){
					if(i!=k&&d[i]>=2&&d[j]>=4&&d[k]>=4)
						++r;
				}
			}
		}
		System.out.println(r);
	}
}
