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

public class Main {
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		sc.close();

		Map<Integer, Integer> map = new HashMap<Integer, Integer>();
		for (int i = 2; i <= n; i++) {
			int num = i;
			for (int sosuu : map.keySet()) {
				while (num % sosuu == 0) {
					map.put(sosuu, map.get(sosuu) + 1);
					num /= sosuu;
				}
			}
			if (num == i) {
				map.put(num, 1);
			}
		}

		long ans = 1;
		for (int sosuu : map.keySet()) {
			ans = ans * (map.get(sosuu) + 1) % 1000000007;
		}
		System.out.println(ans);
	}
}
