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{
    Scanner in = new Scanner(System.in);
    long MOD = 1000000007;

    long[] l = new long[1001];
    void solve(){
        int n = in.nextInt();
        for(int i = 1; i <= n; i++){
            fn(i);
        }
        long ans = 1;
        for(int i = 2; i <= n; i++){
            ans = ans * (l[i] + 1) % MOD;
        }
        System.out.println(ans);
    }

    void fn(int x){
        for(int i = 2; i * i <= x; i++){
            if(x % i == 0){
                fn(i);
                fn(x / i);
                return;
            }
        }
        l[x]++;
    }

    public static void main(String[] args){
       new Main().solve();    
    }
}