def linear_recursion(item, items, index):
  if len(items) == 0: return -1
  candidate = items.pop(0)
  if item == candidate:
    return index
  else:
    return linear_recursion(item, items, index+1)

def search(item, items):
  return linear_recursion(item, items, 0)