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 {

	private static final long x = 1000000000 + 7;

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		int[] a = new int[n+1];
		for(int i=2;i<n+1;i++){
			int y = i;
			while(1 < y) {
				for(int j=2;j<y+1;j++){
					if(y % j == 0){
						a[j]++;
						y /= j;
						break;
					}
				}
			}
		}

		long count = 1;
		for(int i=0;i<n+1;i++){
			if(a[i] != 0){
				count *= (a[i] + 1);
				count %= x;
			}
		}
		System.out.println(count);
	}

}
