Write a function fib that takes in a number argument, n, and returns the n-th number of the Fibonacci sequence.
The 0-th number of the sequence is 0.
The 1-st number of the sequence is 1.
To generate further numbers of the sequence, calculate the sum of previous two numbers.
fib(0); # -> 0fib(1); # -> 1fib(2); # -> 1fib(3); # -> 2fib(4); # -> 3fib(5); # -> 5fib(35); # -> 9227465fib(46); # -> 1836311903