yes

59. Fibonacci (easy version)

Time Limit: 1 seconds

Memory Limit: 128 MB

Rating: 1200

Output the $N$-th number in the Fibonacci sequence modulo $10^9+7$, where term $0$ is $0$ and term $1$ is $1$. $(0 \le N \le 10^4)$

The first line has integer $N$.

Output the answer.

Sample Input 1:
0

Sample Output 1:
0


Sample Input 2:
10

Sample Output 2:
55

https://en.wikipedia.org/wiki/Fibonacci_sequence

IanOJ Contest #1 (Div. 3) > Problem E1