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.*;

public class Main {

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

	int MOD = 1000000007;

	public void run() {
		Scanner sc = new Scanner(System.in);
		int n=sc.nextInt();

		int cnt[] = new int[n+1];
		for(int i=2; i<=n; i++) {
			int d = i;
			for(int j=2; j<=d; j++) {
				if(d%j==0) {
					while(d%j==0) {
						cnt[j]++;
						d/=j;
					}
				}
			}
		}
		long ans = 1;
		for(int i=2; i<=n; i++) {
			ans *= (cnt[i]+1);
			ans %= MOD;

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


}
