PROGRAMMING:Finding the nth term of Fibonacci sequence
Find the nth term f [n]. F [0] = 1 of Fibonacci sequence; f[1]=1 ; f[n]=f[n-1]+f[n-2];
###Input format:
Enter a positive integer n of no more than 10000.
###Output format:
Output the value of the nth term of Fibonacci sequence.
###Input example:
Here is a set of inputs. For example:
```in
ninety-nine
```
###Output example:
The corresponding output is given here. For example:
```out
354224848179261915075
```
answer:If there is no answer, please comment
###Input format:
Enter a positive integer n of no more than 10000.
###Output format:
Output the value of the nth term of Fibonacci sequence.
###Input example:
Here is a set of inputs. For example:
```in
ninety-nine
```
###Output example:
The corresponding output is given here. For example:
```out
354224848179261915075
```
answer:If there is no answer, please comment