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 mod = (long)(Math.pow(10, 9)+7);
		int n  = sc.nextInt();
 
		long sosu[] = new long[n+1];
 
		for(int i = 2;i <= n;i++){
			int j = i;
			while(j > 1){
				for(int k = 2;k <= j;k++){
					if(j%k == 0){
						//System.out.println("i:"+i+" j:"+j);
						sosu[k]++;
						j /= k;
						break;
					}
				}
			}
		}
		long answer = 1;
		for(int i = 2;i < sosu.length;i++){
			if(sosu[i] > 0)answer = (answer*(sosu[i]+1))%mod;
		}
 
		System.out.println(answer);
	}
}