Python Challenge - Fibonacci Finder

My code seems OK but i have 2/5 tests passed.

def fib_finder(n): # Write your code here # We initiate our Fibonacci list with 0 and 1. fib_list = [0, 1] # We iterate to add an element until the nth number in the if n < 0 : return "{} isn't right! You should try with a positive integer.".format(n) elif (n == 0) or (n == 1) : return 0 elif n == 2: return 1 else: while len(fib_list) <= n: new_fib_item = fib_list[-1] + fib_list[-2] fib_list.append(new_fib_item) #return the nth number which is the last one. return fib_list[-1] print(fib_finder(5))

Lists start with an index of 0, but there’s no 0th Fibonnacci number for this excercise,
so if you’re using the nth index for the nth Fibonnaci number,
your initial list should have an extra element at index 0 to account for that;
like this

  fib_list = [0, 0, 1]