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();
    ArrayList<Integer> list = new ArrayList<Integer>();
    long MOD = (long)Math.pow(10, 9) + 7;
    for(int i = 2; i <= n; i++) {
      int p = 0;
      for(int j = 2; (j * j) <= i; j++) {
        if((i % j) == 0) p++;  
      }
      if(p == 0) list.add(i);
    }
    long ans = 1;
    for(int i = 0; i < list.size(); i++) {
      int g = list.get(i);
      int t = 0;
      int m = n;
      while(m > 0) {
        t += (m / g);
        m /= g;
      }
      ans = (ans * (long)(t + 1)) % MOD;
    }
    System.out.println(ans);
  }
}
