Nth Fibonacci Number Modulo 10^9+7

Calculate the N-th Fibonacci number modulo $10^9+7$.

The Fibonacci sequence is defined as:
$$F(0)=0,; F(1)=1,$$
and for $$n>1,; F(n)=F(n-1)+F(n-2).$$

Given a non-negative integer N, compute $$F(N)\bmod (10^9+7).$$

inputFormat

The input consists of a single non-negative integer N provided via stdin.

outputFormat

Output the value of the N-th Fibonacci number modulo $10^9+7$ to stdout.## sample

0

0