Description

The Fibonacci sequence 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55... starts with 0 and 1, and each subsequent term is the sum of the two immediately preceding terms. Write a recursive program to compute any term of the Fibonacci sequence. (The first term is 0)

Input Format

The term number to be computed

Output Format

The value of the term

```input1 10 ``` ```output1 34 ``` ## 译文

CodesOnline