You are given an integer N. Find the number of the positive divisors of N!, modulo 10^9+7.

Constraints

* 1≤N≤10^3

Input

The input is given from Standard Input in the following format:


N


Output

Print the number of the positive divisors of N!, modulo 10^9+7.

Examples

Input

3


Output

4


Input

6


Output

30


Input

1000


Output

972926972
import java.util.*;

public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    long N = sc.nextInt();
    long MOD = 1000000007;
    long num = 1;
    for(int i = 2; i <= N; i++) {
      if(isPrime(i)) {
        long power = 0;
        for(int k = 1; k < 10; k++) {
          if(N >= Math.pow(i, k)) {
            power += (N / (long)Math.pow(i, k));
          } else {
            break;
          }
        }
        num = (num * (power + 1)) % MOD;
      }
    }
    System.out.println(num);
  }

  public static boolean isPrime(int n) {
    boolean flg = true;
    for(int i = 2; i * i <= n; i++) {
      if(n % i == 0) {
        flg = false;
        break;
      } 
    }
    return flg;
  }
}