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 = Integer.parseInt(sc.next());
		long[] cnt = new long[n + 1];
		final int MOD = 1000000007;

		for (int i = 2; i <= n; i++) {
			int tmp = i;
			int div = 2;
			while (tmp != 1) {
				if (tmp % div == 0) {
					cnt[div]++;
					tmp /= div;
				} else {
					div++;
				}
			}
		}

		long sum = 1;
		for (int i = 2; i <= n; i++) {
			sum *= (cnt[i] + 1);
			sum %= MOD;
			//			System.out.println(cnt[i]);
		}

		System.out.println(sum);
		sc.close();
	}
}