import string
from math import logaa



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







    __UpperCamelCase  :List[Any]    						=	document.translate(
        str.maketrans(''''''						,    ''''''						,    string.punctuation			)			).replace('''\n'''						,    ''''''			)
    __UpperCamelCase  :Any    						=	document_without_punctuation.split(''' '''			)  # word tokenization
    return len([word for word in tokenize_document if word.lower() == term.lower()]			)



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







    __UpperCamelCase  :Union[str, Any]    						=	corpus.lower().translate(
        str.maketrans(''''''						,    ''''''						,    string.punctuation			)			)  # strip all punctuation and replace it with ''
    __UpperCamelCase  :Optional[Any]    						=	corpus_without_punctuation.split('''\n'''			)
    __UpperCamelCase  :str    						=	term.lower()
    return (len([doc for doc in docs if term in doc]			), len(SCREAMING_SNAKE_CASE			))



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







    if smoothing:
        if n == 0:
            raise ValueError('''log10(0) is undefined.'''			)
        return round(1 + logaa(n / (1 + df)			)						,    3			)

    if df == 0:
        raise ZeroDivisionError('''df must be > 0'''			)
    elif n == 0:
        raise ValueError('''log10(0) is undefined.'''			)
    return round(logaa(n / df			)						,    3			)



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







    return round(tf * idf						,    3			)






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}.')





