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.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		long mod = 1000000007;
		long count = 1;
		boolean[] num = new boolean[n+1];
		Arrays.fill(num, true);
		num[0] = false;
		num[1] = false;
		double m = Math.sqrt(n);
		for (int i = 2; i <= m; i++) {
			for (int j = i*2; j <= n; j+=i) {
				num[j] = false;
			}
		}
		Map<Integer, Integer> map = new HashMap<>();
		for (int i = 0; i <= n; i++) {
			if (num[i]) {
				map.put(i, 0);
			}
		}
		
		for (int i = 2; i <= n; i++) {
			int N = i;
			for (Integer p : map.keySet()) {
				while (N%p == 0) {
					map.put(p, map.get(p)+1);
					N/=p;
				}
			}
		}
		for (Integer p : map.keySet()) {
			count = (count*(map.get(p)+1))%mod;
		}
		System.out.println(count);
	}
}
