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();

    sc.close();

    int[] primeNumber  = new int[1001];

    long mod = 1000000000 + 7;

    for (int i = 2; i <= N; i++) {
      
      int j = i;

      while (j > 1) {
        for (int k = 2; k <= j; k++) {
          if (j % k == 0) {
            primeNumber[k]++;
            j = j / k;
            break;
          }
        }
      }

    }

    long ans = 1;

    for (int i = 2; i <primeNumber.length; i++) {
      ans =  ans * (primeNumber[i]+1) % mod;
    }

    System.out.println(ans);

  }

}