Don’t worry. It’s just a very simple problem. See the recursive function below.

The only thing you should do is to show
and nothing else. Easy, right?
There are several test cases. Each line contains one integer, n
![]()
For each test, output a line containing a single,
(modulo 100000007).