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();
		
		long sum = 1;
		long c = 1000000007;
		long[] soinsu = new long[1000];
		
		for(int i = 1; i <= N; i++) {
			loop:
			for(int j = 2; j <= N; j++) {
				if(j % 2 == 0 && j > 2) {
					continue;
				}
				for(int k = 2; k <= j - 1; k++) {
					if(j % k == 0) {
						continue loop;
					}
				}
				int a = i;
				while(a % j == 0 && j > 1) {
					soinsu[j]++;
					a /= j;
				}
			}
		}
		for(int i = 0; i < soinsu.length; i++) {
			if(soinsu[i] > 0) {
				sum = sum % c * (soinsu[i] + 1) % c;
			}
		}
		System.out.println(sum);
	}
}
