Fibonacci Number Computation

Given a non-negative integer (n), your task is to compute the (n)th Fibonacci number. The Fibonacci sequence is defined as follows: (F(0)=0), (F(1)=1), and for (n \geq 2), (F(n)=F(n-1)+F(n-2)). Read the input from standard input and output the result to standard output.

inputFormat

The input consists of a single integer (n) (where (0 \leq n \leq 50)) provided on one line from the standard input.

outputFormat

Output a single integer representing the (n)th Fibonacci number to the standard output.## sample

0

0