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) throws Exception {
	    Scanner sc = new Scanner(System.in);   
	    int N = sc.nextInt();
	    
	    if (N == 1) {
	    	System.out.println(1);
	    	return;
	    }
	    
	    int[] map = new int[1001];
	    map[1] = 1;
	    for (int i = 2; i <= N; i++) {
	    	int tmp = 2;
	    	int iCopy = i;
	    	while(iCopy != 1) {
	    		if (iCopy % tmp == 0) {
	    			map[tmp]++;
	    			iCopy /= tmp;
	    		} else {
	    			tmp++;
	    		}
	    	}
	    }
	    
	    long ans = 1;
	    for (int i = 2; i < map.length; i++) {
	    	ans *= (map[i] + 1);
	    	ans %= 1_000_000_007;
	    }
	    
	    System.out.println(ans);
	}    
}	