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();
		int[] fact = new int[n + 1];
		 long ans = 1;
		for (int j = 2; j <= n; j++) {
			for (int i = 2; i <= j; i++) {
				int m = j;
				if (sosuu(i)) {
					while (m % i == 0) {
						m = m / i;
						fact[i]++;
					}
				}
			}
		}
		for (int i = 2; i <= n; i++) {
			if (fact[i] > 0)
				ans *= (fact[i] + 1);
			ans=ans%(1000000000+7);
		}

		System.out.println(ans%(1000000000+7));
	}

	static boolean sosuu(int n) {
		if (n == 1)
			return false;
		else {
			for (int i = 2; i < n; i++) {
				if (n % i == 0)
					return false;
			}
			return true;
		}
	}
}
