Fibonacci Number

Given an integer \(N\), compute the \(N\)th Fibonacci number. The Fibonacci sequence is defined as follows: \(F(0)=0\), \(F(1)=1\), and for \(n \ge 2\), \(F(n)=F(n-1)+F(n-2)\). Participants are required to calculate and output the \(N\)th term of this sequence.

inputFormat

The input consists of a single integer \(N\) provided through standard input. \(N\) represents the term of the Fibonacci sequence to compute.

outputFormat

Output a single integer representing the \(N\)th Fibonacci number to standard output.

5

5