Fibonacci Number

Easyjavapythonccppjavascript

Find the N-th Fibonacci number. The sequence starts 0, 1, 1, 2, 3, 5, ... (0-indexed: F(0) = 0, F(1) = 1).

Input Format

A single line containing the integer N.

Output Format

Print F(N).

Example 1

Input

Output

Explanation: The sequence is 0, 1, 1, 2, 3, 5, 8, 13.

Related Problems

Factorial Using Recursion
Easy · java, python, c, cpp, javascript
Solve Problem
Power Using Recursion
Easy · java, python, c, cpp, javascript
Solve Problem
Generate All Subsets
Medium · java, python, c, cpp, javascript
Solve Problem

Input (stdin)

Output

Run your code to see output here...