CSES - Fibonacci Numbers
  • Time limit: 1.00 s
  • Memory limit: 512 MB

The Fibonacci numbers can be defined as follows:

  • F0=0F_0=0
  • F1=1F_1=1
  • Fn=Fn2+Fn1F_n = F_{n-2}+F_{n-1}

Your task is to calculate the value of FnF_n for a given nn.

Input

The only input line has an integer nn.

Output

Print the value of FnF_n modulo 109+710^9+7.

Constraints

  • 0n10180 \le n \le 10^{18}

Example

Input:

10

Output:

55