Given an integer n, what Fibonacci number is at that position?
Use zero-based indexing, where F(0) = 0 and F(1) = 1. Implement the function to return the exact integer value of F(n).
The input is a non-negative integer, and the output is an integer.
def fibonacci(n):