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) {
		Scanner scn = new Scanner(System.in);
		int N = scn.nextInt();
		int[] num = new int[N+1];
		for(int i = 1;i <= N;i++) {
			int buf = i;
			for(int j = 2;j <=buf;j++) {
				while(buf%j==0) {
					num[j]++;
					buf /= j;
				}
			}
		}
		long ans = 1;
		long mod = 1000000007;
		for(int i = 0;i <= N;i++) {
			ans *= num[i]+1;
			ans %= mod;
		}
		System.out.println(ans);
	}

}
