• محدودیت زمان: ۱ ثانیه
• محدودیت حافظه: ۲۵۶ مگابایت

Majid has $n$ cubic bricks with a unit side length. He wants to arrange these bricks as adjacent columns, such that the height of each column is not less than the height of the previous column. For example, if Majid has two bricks, he can arrange them in two ways. In the first arrangement, he can form a column with a height of $2$, and in the second arrangement, he can create two columns with heights of $1$ each. Majid wants to know in how many ways he can do this. Given $n$, calculate the number of possible desired arrangements.

ورودی

The input consists of a single integer $n$ $(1 \leq n \leq 2000)$, which represents the number of bricks Majid has.

خروجی

Print a single line containing the number of desired arrangements of the bricks. Since this number can be very large, print its remainder modulo $10^9 + 7$.

ورودی نمونه 1

1

خروجی نمونه 1

1

ورودی نمونه 2

2

خروجی نمونه 2

2