022-fibonacci-series

Fibonacci Series

Challenge Description:

The Fibonacci series is defined as: F(0) = 0; F(1) = 1; F(n) = F(n–1) + F(n–2) when n>1. Given an integer n≥0, print out the F(n).

Input sample:

The first argument will be a path to a filename containing integer numbers, one per line. E.g.

5
12

Output sample:

Print to stdout, the fibonacci number, F(n). E.g.

5
144