Number of Divisors of n!
Compute the number of positive divisors of \(n!\) modulo \(1,000,000,007\).
Input
One line containing \(n\).
The input satisfies:
- \(1 \le n \le 10^5\)
Output
Print the result.
Example
Input
8215Output
876009158Compute the number of positive divisors of \(n!\) modulo \(1,000,000,007\).
One line containing \(n\).
The input satisfies:
Print the result.
8215876009158
Comments