Popeye loves his garden as much as he loves his arrays. But recently he got bored of implementations of sequences on arrays. This time he came up with something new with the gardens. He decided to make increasing gardens. Popeye has $N$ rows and in each row, he can have $x$ plants where $x$ belongs to $[1, N]$. There is a rule for making garden increasing,  i.e. plants in the $i^{th}$ row are not greater than plants in the $(i+1)^{th}$ row where $i$ belongs to the range $[1,N-1]$.

Popeye is not interested in the garden because he can easily make one but he is interested in the total number of different gardens. Print the answer modulo $1000000007$.

Input

The only line containing integer $N$ denoting the number of rows in the garden.

Output

Print the different possible gardens satisfying the requirement modulo $10^{9} +7$ 

Constraints
$1 \le N \le 100000$