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) {	
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		sc.close();
		
		int mod = (int)1e9+7;
		
		int cnt[] = new int[N+1];
		
		for(int i=2;i<=N;i++) {
			int tmp = i;
			for(int j=2;j*j<=tmp;j++) {
				while(tmp%j==0) {
					tmp /= j;
					cnt[j]++;
				}
			}
			if(tmp!=1)cnt[tmp]++;
		}
		
		long ans = 1;
		for(int t:cnt) {
			ans *= (t+1);
			ans %= mod;
		}
		System.out.println(ans);
	}
	
}