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.io.*;
import java.util.*;

class Main {

	static final int M = 1000000007;

	private static int[] counts;

	private static void factorize(int n) {
		for (int i = 2; i * i <= n; i++) {
			if (n % i != 0) continue;
			int count = 0;
			while (n % i == 0) {
				count++;
				n /= i;
			}
			counts[i] += count;
		}
		if (n != 1) {
			counts[n]++;
		}
	}


	public static void main(String[] args) throws Exception {
		final Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		counts = new int[N + 1];

		for (int i = 2; i <= N; i++) {
			factorize(i);
		}

		long a = 1;
		for (int i = 0; i < counts.length; i++) {
			if (counts[i] == 0) continue;
			a = (a * (counts[i] + 1)) % M;
		}

		System.out.println(a);
	}
}
