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.*;
import java.io.*;
public class Main{
    public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		PrintWriter ou = new PrintWriter(System.out);
		int n = Integer.parseInt(sc.next());
		sc.close();
		long yono = 1;
		for(int i = 2 ; i <= n ; i++){
			boolean sos = true;
			for(int j = 2 ; sos && j <= Math.sqrt(i) ; j++){
				if(i % j == 0) sos = false;
			}
			if(sos){
				int now = n;
				long so = 1;
				while(now != 0){
					so += now / i;
					now /= i;
				}
				yono *= so;
				yono %= 1000000007;
			}
		}
		ou.print(yono + "\n");
		ou.flush();
    }
}