from __future__ import annotations



def lowerCamelCase						(     SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE			):
    '''simple docstring'''







    __UpperCamelCase						, __UpperCamelCase  :int    						=	position
    __UpperCamelCase  :List[str]    						=	[
        (y + 1, x + 2),
        (y - 1, x + 2),
        (y + 1, x - 2),
        (y - 1, x - 2),
        (y + 2, x + 1),
        (y + 2, x - 1),
        (y - 2, x + 1),
        (y - 2, x - 1),
    ]
    __UpperCamelCase  :Union[str, Any]    						=	[]

    for position in positions:
        __UpperCamelCase						, __UpperCamelCase  :Tuple    						=	position
        if 0 <= y_test < n and 0 <= x_test < n:
            permissible_positions.append(__lowerCAmelCase			)

    return permissible_positions



def lowerCamelCase						(     SCREAMING_SNAKE_CASE			):
    '''simple docstring'''







    return not any(elem == 0 for row in board for elem in row			)



def lowerCamelCase						(     SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE			):
    '''simple docstring'''







    if is_complete(__lowerCAmelCase			):
        return True

    for position in get_valid_pos(__lowerCAmelCase						,    len(__lowerCAmelCase			)			):
        __UpperCamelCase						, __UpperCamelCase  :List[Any]    						=	position

        if board[y][x] == 0:
            __UpperCamelCase  :int    						=	curr + 1
            if open_knight_tour_helper(__lowerCAmelCase						,    __lowerCAmelCase						,    curr + 1			):
                return True
            __UpperCamelCase  :Dict    						=	0

    return False



def lowerCamelCase						(     SCREAMING_SNAKE_CASE			):
    '''simple docstring'''







    __UpperCamelCase  :Any    						=	[[0 for i in range(__lowerCAmelCase			)] for j in range(__lowerCAmelCase			)]

    for i in range(__lowerCAmelCase			):
        for j in range(__lowerCAmelCase			):
            __UpperCamelCase  :int    						=	1
            if open_knight_tour_helper(__lowerCAmelCase						,    (i, j)						,    1			):
                return board
            __UpperCamelCase  :Any    						=	0

    __UpperCamelCase  :str    						=	f"""Open Kight Tour cannot be performed on a board of size {n}"""
    raise ValueError(__lowerCAmelCase			)


if __name__ == "__main__":
    import doctest

    doctest.testmod()






from __future__ import annotations

import bisect



def lowerCamelCase						(     SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE = 0						,    SCREAMING_SNAKE_CASE = -1			):
    '''simple docstring'''







    if hi < 0:
        __UpperCamelCase  :str    						=	len(SCREAMING_SNAKE_CASE			)

    while lo < hi:
        __UpperCamelCase  :Optional[int]    						=	lo + (hi - lo) // 2
        if sorted_collection[mid] < item:
            __UpperCamelCase  :List[Any]    						=	mid + 1
        else:
            __UpperCamelCase  :Any    						=	mid

    return lo



def lowerCamelCase						(     SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE = 0						,    SCREAMING_SNAKE_CASE = -1			):
    '''simple docstring'''







    if hi < 0:
        __UpperCamelCase  :List[str]    						=	len(SCREAMING_SNAKE_CASE			)

    while lo < hi:
        __UpperCamelCase  :Optional[Any]    						=	lo + (hi - lo) // 2
        if sorted_collection[mid] <= item:
            __UpperCamelCase  :Dict    						=	mid + 1
        else:
            __UpperCamelCase  :Optional[Any]    						=	mid

    return lo



def lowerCamelCase						(     SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE = 0						,    SCREAMING_SNAKE_CASE = -1			):
    '''simple docstring'''







    sorted_collection.insert(bisect_left(SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE			)						,    SCREAMING_SNAKE_CASE			)



def lowerCamelCase						(     SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE = 0						,    SCREAMING_SNAKE_CASE = -1			):
    '''simple docstring'''







    sorted_collection.insert(bisect_right(SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE			)						,    SCREAMING_SNAKE_CASE			)



def lowerCamelCase						(     SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE			):
    '''simple docstring'''







    __UpperCamelCase  :Tuple    						=	0
    __UpperCamelCase  :List[str]    						=	len(SCREAMING_SNAKE_CASE			) - 1

    while left <= right:
        __UpperCamelCase  :Optional[int]    						=	left + (right - left) // 2
        __UpperCamelCase  :List[str]    						=	sorted_collection[midpoint]
        if current_item == item:
            return midpoint
        elif item < current_item:
            __UpperCamelCase  :Union[str, Any]    						=	midpoint - 1
        else:
            __UpperCamelCase  :Dict    						=	midpoint + 1
    return None



def lowerCamelCase						(     SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE			):
    '''simple docstring'''







    __UpperCamelCase  :Dict    						=	bisect.bisect_left(SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE			)
    if index != len(SCREAMING_SNAKE_CASE			) and sorted_collection[index] == item:
        return index
    return None



def lowerCamelCase						(     SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE			):
    '''simple docstring'''







    if right < left:
        return None

    __UpperCamelCase  :str    						=	left + (right - left) // 2

    if sorted_collection[midpoint] == item:
        return midpoint
    elif sorted_collection[midpoint] > item:
        return binary_search_by_recursion(SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE						,    midpoint - 1			)
    else:
        return binary_search_by_recursion(SCREAMING_SNAKE_CASE						,    SCREAMING_SNAKE_CASE						,    midpoint + 1						,    SCREAMING_SNAKE_CASE			)


if __name__ == "__main__":
    __lowercase											=      input('''Enter numbers separated by comma:\n''').strip()
    __lowercase											=      sorted(int(item) for item in user_input.split(''','''))
    __lowercase											=      int(input('''Enter a single number to be found in the list:\n'''))
    __lowercase											=      binary_search(collection, target)
    if result is None:
        print(F'{target} was not found in {collection}.')
    else:
        print(F'{target} was found at position {result} in {collection}.')





