An integer
N is given. Find the number of positive divisors of
N!, modulo
\(10 ^ 9 + 7\).
Input
The input is an integer
N (
\(1<=N<=10^3\)).
Imprint
Print the number of positive divisors of
N!, modulo
\(10 ^ 9 + 7\).
Examples
| # |
Input |
Output |
| 1 |
3 |
4 |
| 2 |
6 |
30 |
| 3 |
1000 |
972926972 |