PROGRAMMING:Grumpy cow 1
Bear_ There are many cattle in Qingqing grassland. These cattle are divided into two kinds, one is the grumpy cattle, the other is the gentle cattle_ 2. I want to select n cattle from my own cattle to form a line. Because two consecutive irascible cattle are adjacent, something bad will happen * *, so two consecutive irascible cattle can't be adjacent. Suppose bear is a good cow_ 2. There are infinitely many cattle. Now he wants to ask you how many legal sequences can be formed. The answer is to take the model of 100000007.
###Input format:
Enter a positive integer n (1 < = n < = 1000).
###Output format:
Output a positive integer（ The data range is large * * Please use long long variable * *)
###Input example:
```in
one
```
###Output example:
```out
two
```
###Input example:
```in
two
```
###Output example:
```out
three
```
answer：If there is no answer, please comment
###Input format:
Enter a positive integer n (1 < = n < = 1000).
###Output format:
Output a positive integer（ The data range is large * * Please use long long variable * *)
###Input example:
```in
one
```
###Output example:
```out
two
```
###Input example:
```in
two
```
###Output example:
```out
three
```
answer：If there is no answer, please comment