Fibonacci numbers (1) P72994

The Fibonacci numbers $F_n$ are defined as follows: $$F_n = \left\{ \begin{array}{ll} 0 & \mbox{if $n = 0$} \\ 1 & \mbox{if $n = 1$} \\ F_{n-1} + F_{n-2} & \mbox{if $n \ge 2$} \end{array} \right.$$ Therefore, the first Fibonacci numbers are 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, …

For every given natural number $n$, compute $F_n \bmod 10^8 + 7$.

Input

Input consists of several $n$. Assume $0 \le n \le 10^5$.

Output

For every given $n$, print $F_n \bmod 10^8 + 7$.