Complete the function fib so it returns the nth Fibonacci number (1-indexed, where fib(1)=0, fib(2)=1, and each later term is the sum of the previous two). The main function reads n and prints fib(n).

Example: input 7 prints 8 (sequence: 0 1 1 2 3 5 8).