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);
    int N = sc.nextInt();
    
    List<Integer> prime = new ArrayList<>();
    for (int i = 2; i <= N; i++) {
      boolean isPrime = true;
      for (int j = 2; j < i; j++) {
        if (i%j == 0) {
          isPrime = false;
          break;
        }
      }
      if (isPrime) {
        prime.add(i);
      }
    }
    
    int[] factor = new int[N+1];
    for (int i = 2; i <= N; i++) {
      for (int p : prime) {
        if (p > i) {
          break;
        }
        int n = i;
        while (n > 1 && n%p == 0) {
          factor[p]++;
          n /= p;
        }
      }
    }
    
    long ans = 1;
    for (int i = 2; i <= N; i++) {
      if (factor[i] > 0) {
        ans = ans * (factor[i]+1) % 1000000007;
      }
    }
 
    System.out.println(ans);
  }
}