I. Partition
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Aline noticed that there are several ways to write a number $$$n$$$ as the sum of other positive integers. For example, the number $$$3$$$ can be written in $$$4$$$ ways:

$$$3 = 1 + 1 + 1 = 1 + 2 = 2 + 1 = 3$$$

Help Aline compute how many ways a number $$$n$$$ can be written. Compute the answer modulo $$$10^9 + 7$$$.

Input

The input consists of a single integer $$$1 \leq n \leq 10^6$$$.

Output

Print the number of ways to write $$$n$$$ as the sum of other positive integers, modulo $$$10^9 + 7$$$.

Examples
Input
1
Output
1
Input
3
Output
4