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
#include<iostream>
#include <bits/stdc++.h>
#include<stdio.h>
#include <stdlib.h>
#include<string>
#include<queue>
#include<algorithm>
#include<math.h>
using namespace std;

long long int X,Y=1,A[1001];

int main(){
	cin>>X;
	for(int i=1;i<=X;i++){
		A[i]=i;
	}
	for(int i=2;i<=X;i++){
		int count=0;
		for(int j=2;j<=X;j++){
			while(A[j]%i==0){
				A[j]/=i;
				count++;
			}
		}
		Y*=count+1;
		Y%=1000000007;
	}
	cout<<Y<<endl;
}