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.Arrays;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		final long Mod = 1000_000_007;
		Scanner sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.next());
		sc.close();
		int[] a = new int[n+1];
		Arrays.fill(a, 1);
		long res = 1;

		for(int i = 2;i<=n;i++) {
			int t=i;
			for(int j=2;j<=t;j++) {
				while(t%j==0) {
					t/=j;
					a[j]++;
				}
			}
		}
		for(int i=1;i<=n;i++) {
			res = res*a[i];
			for(;res>Mod;)res-=Mod;
		}
		System.out.println(res);
	}
}