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) {
		final Scanner sc = new Scanner(System.in);
		int x = sc.nextInt();
		int[] nums = new int[1001];
		for(int i = 2; i <= x; i++) {
			int num = i;
			int warusu = 2;
			while(num > 1) {
				if(num%warusu==0) {
					nums[warusu]++;
					num/=warusu;
				} else warusu++;
			}
		}
		long ans = 1;
		for(int j = 2; j <= 1000; j++) {
			ans = (ans*(nums[j]+1)) % 1000000007;
		}
		System.out.println(ans);
	}
}