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

public class Main {

  static Scanner sc = new Scanner(System.in);

  static int[] primes = {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};

  static int[] factors = new int[primes.length];

  public static void main(String[] args) {

    int N = sc.nextInt();

    //N!の素因数分解
    for (int i=2; i<=N; i++) {
      int n = i;
      for (int j=0; j<primes.length; j++) {
        if (n % primes[j] == 0) {
          n /= primes[j];
          factors[j]++;
          j--;
          if (n == 1) break;
        }
      }
    }

    System.out.println(f(2, 4, 4) + f(4, 2, 4) + f(4, 4, 2) +
            g(4, 14) + g(14, 4) + g(2, 24) + g(24, 2) + h(74));

  }

  static int f(int a, int b, int c) {
    int ret = 0;
    for (int i=0; i<primes.length; i++) {
      for (int j=i+1; j<primes.length; j++) {
        for (int k=j+1; k<primes.length; k++) {
          if (factors[i] >= a && factors[j] >= b && factors[k] >= c) {
            ret++;
          }
        }
      }
    }
    return ret;
  }

  static int g(int a, int b) {
    int ret = 0;
    for (int i=0; i<primes.length; i++) {
      for (int j=i+1; j<primes.length; j++) {
        if (factors[i] >= a && factors[j] >= b) {
          ret++;
        }
      }
    }
    return ret;
  }

  static int h(int a) {
    int ret = 0;
    for (int i=0; i<primes.length; i++) {
      if (factors[i] >= a) {
        ret++;
      }
    }
    return ret;
  }

}
