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 {
	void run() {
		Scanner sc = new Scanner(System.in);

		int n = sc.nextInt();
		int[] a = new int[n + 1];
		for (int k = 2; k <= n; k++) {
			int t = k;
			while (1 < t) {
				for (int i = 2; i <= t; i++) {
					if (t % i == 0) {
						a[i]++;
						t /= i;
						break;
					}
				}
			}
		}
		long count = 1;
		long MOD = 1_000_000_000 + 7;
		for (int i = 0; i < n + 1; i++) {
			if (a[i] != 0) {
				count *= (a[i] + 1);
				count %= MOD;
			}
		}
		System.out.println(count);
	}

	public static void main(String[] args) {
		new Main().run();
	}
}
