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 {

	@SuppressWarnings("resource")
	public static void main(String args[]) {
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		long ans = 1;
		int mod = (int) Math.pow(10, 9) + 7;
		for (int i = 2; i <= n; i++) {
			for (int j = 2; (i % j != 0 && j < i) || j == i; j++) {
				if (j == i) {
					int s = 0;
					for (int k = 1; k <= n; k++) {
						s += findS(k, i);

					}

					ans = (ans % mod * (s + 1) % mod) % mod;

				}
			}
		}
		System.out.println(ans);
	}

	private static int findS(int k, int i) {
		int s = 0;
		for (int j = k; j % i == 0; j /= i) {

			s++;

		}
		return s;
	}
}
