The nth Fibonacci Number

No attempts yetTime limit1sMemory limit256 MB

Problem

The Fibonacci sequence starts with 0 and 1. The 0th Fibonacci number is 0, and the 1st is 1. From index 2 on, each number is the sum of the two numbers before it.

As a formula, Fn=Fn1+Fn2F_n = F_{n-1} + F_{n-2} for n2n \ge 2.

Listed up to n=17n = 17, the sequence is:

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 15970,\ 1,\ 1,\ 2,\ 3,\ 5,\ 8,\ 13,\ 21,\ 34,\ 55,\ 89,\ 144,\ 233,\ 377,\ 610,\ 987,\ 1597

Given nn, write a program that computes the nnth Fibonacci number.

Input

The first line contains nn. It is either 0 or a natural number less than or equal to 20.

Output

Print the nnth Fibonacci number on the first line.