recursion: find the highest index for a number in a list

highest_index.py

def hi_index(n, l):
  if l[-1] == n:
    return len(l)-1
  else:
    return hi_index(n, l[0:len(l)-1])

if __name__ == "__main__":
  l = [3, 5, 4, 3, 4, 9, 5, 7, 7, 9]
  print(f'given the list {l}\n')
  n = int(input('pick a number to find its largest index: '))
  print(f'The last index for {n} in {l} is {hi_index(n, l)}')