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.Scanner;

public class Main {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		long ans = 1;
		long[] nums = new long[1001];
		for (int i = 2; i <= n; i++) {
			int tmp = i;
			for(int j=2; j<=tmp; j++) {
				while(tmp%j == 0) {
					nums[j]++;
					tmp = tmp/j;
				}
			}
		}
		for(int i=0; i<nums.length; i++) {
			ans *= (nums[i] + 1);
			ans %= 1000000007; 
		}
		System.out.println(ans);
	}
}
