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.*;

class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        final int Mod = 1000000000+7;
        int[] rec= new int[N+1];
        long ans = 1;
        for(int i=2;i<=N;i++){
            int k=i;
            for(int j=2;j<=k;j++){
                while(k%j==0){
                    rec[j]++;
                    k = k/j;
                }
            }
            //if(k>0) rec[k]++;
        }
        for(int i=2;i<=N;i++){
            if(rec[i]>0) ans = ans*(rec[i]+1)%Mod;
        }
        System.out.println(ans%Mod);
    }
}
