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 = Integer.parseInt(sc.next());
        int[] count = new int[n+1];
        long ans = 1;
        for(int i=2; i<=n; i++) {
            int x = i;
            for(int j=2; j<=i; j++) {
                if(x == 1) break;
                while(true) {
                    if(x % j == 0) {
                        x /= j;
                        count[j]++;
                    }else {
                        break;
                    }
                }
            }
            if(i == x) count[i]++;
            
        }
        
        
        for(int i=2; i<n+1; i++) {
            if(count[i] > 0) {
                ans *= (count[i]+1);
                ans = ans % 1000000007;
            }
        }
        System.out.println(ans);
        
    }   
}