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
class Main{
  
  public static void main(String args[]){
    int n = new java.util.Scanner(System.in).nextInt();
    
    boolean prime[] = new boolean[n+1];

    java.util.Arrays.fill(prime,true);
    prime[0] = false;
    prime[1] = false;
        
    for(int i = 2; i < prime.length; i++){
      if(prime[i]){
        for(int j = i + i ; j < prime.length; j += i){
          prime[j] = false;
        }
      }
    }
    
    int[] v = new int[n+1];
    for(int i = 0; i< n+1;i++){
      primes(prime,i,v);
    }
//    System.out.println(java.util.Arrays.toString(v));

    int dp[][] = new int[n+2][77];
    dp[0][1] = 1;
    
    for(int i =0 ; i < n+1 ; i++){
      for(int j = 0; j < 76;j++){
        for(int k = 0 ; k <= v[i]; k++){
          if(j * (k+1) > 75) break;
          dp[i+1][j*(k+1)] += dp[i][j];
        }
      }
//      System.out.println(i+" "+java.util.Arrays.toString(dp[i+1]));
    }
    
    System.out.println(dp[n+1][75]);
  }
  
  static int[] primes(boolean[]primes, int target, int[] res){
    for(int i =0; i < primes.length; i++){
      if(primes[i]){
        int t = target;
        while(t % i == 0 && t > 0){
          res[i]++;
          t /= i;
        }
      }
    }
    return res;
  }
}