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);
		long n = sc.nextLong();
		long[] a = new long[1010];
		// 2 * 3 * 4 * .... * n
		for(int i = 2 ; i <= n ; i++) {
			for(int j = 2 ; j <= n ; j++) {
				if(isPrime(j) && i % j == 0) {
					a[j] += func(i, j);
				}
			}
		}
		long ans = 1;
		for(int i = 2 ; i <= 1000 ; i++) {
			ans = ans * (a[i] + 1) % 1000000007;
		}
		System.out.println(ans);
	}

	public static boolean isPrime(int x) {
		boolean ok = true;
		for(int i = 2 ; i * i <= x ; i++) {
			if(x % i == 0) {
				ok = false;
			}
		}
		return ok;
	}

	public static long func(int a, int b) {
		long ret = 0;
		while(a % b == 0) {
			ret++;
			a /= b;
		}
		return ret;
	}

}
