Nth Fibonacci Number

EASY

Nth Fibonacci Number

Given an integer n, return the nth Fibonacci number.

F(0) = 0, F(1) = 1, F(n) = F(n-1) + F(n-2).

Examples

Input: 6
Output: 8

Constraints

  • 0 ≤ n ≤ 30