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();
    int[] count = new int[N+1];
    long ans =1;
    for (int i =2; i<=N; i++) {
      int a =2, b =i;
        while (a <= b) {
          if (b % a == 0) {
            count[a]++;
            b /= a;
            continue;
          }
          a++;
        }
    }
    for (int i =2; i<=N; i++) {
      ans *= (count[i] + 1);
      ans %= 1000000007;
    }
    System.out.print(ans); 
  }
}