Fibonacci Number

In this problem, you are required to compute the (n)th Fibonacci number. The Fibonacci sequence is defined as follows:

[ F(0)=0,\quad F(1)=1, \quad \text{and for } n\geq 2, \quad F(n)=F(n-1)+F(n-2). ]

Given a non-negative integer (n) as input, your task is to compute and print the (n)th Fibonacci number. This problem tests your ability to implement iterative or recursive algorithms under competitive programming constraints.

inputFormat

The input consists of a single integer (n) ((0\leq n\leq 10^5)), provided via standard input (stdin).

outputFormat

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

0

0