200670: [AtCoder]ARC067 C - Factors of Factorial

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Score : $300$ points

Problem Statement

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$.


Sample Input 1

3

Sample Output 1

4

There are four divisors of $3!$ $=6$: $1$, $2$, $3$ and $6$. Thus, the output should be $4$.


Sample Input 2

6

Sample Output 2

30

Sample Input 3

1000

Sample Output 3

972926972

Input

题意翻译

给定正整数 $N \left( 1\leq N \leq 10 ^3 \right)$ 求 $N!$ 的约数个数。结果对 $10^9 + 7$ 取模

加入题单

算法标签: