def binary_search_recursive(
    lst: list, n: int, left_index: int, right_index: int
) -> int:
    """Search any element in a list using recursive binary search and return
        index of element.

    Args:\n
        lst (list[int]): List of elements
        n (int): element to find
        left_index (int): starting index
        right_index (int): ending index

    Returns:\n
        int: index of element
    """
    if right_index < left_index:
        return -1

    mid_index = (left_index + right_index) // 2
    if lst[mid_index] == n:
        return mid_index

    if lst[mid_index] < n:
        left_index = mid_index + 1
    else:
        right_index = mid_index - 1
    return binary_search_recursive(lst, n, left_index, right_index)