
"""simple docstring"""
from doctest import testmod
from math import sqrt





def 				lowerCamelCase_		(UpperCamelCase__	:	List[Any]							):
    _UpperCAmelCase							:						Any       							=					[]
    if num < 1:
        return facs
    facs.append(1							)
    if num == 1:
        return facs
    facs.append(snake_case__							)
    for i in range(2  , int(sqrt(snake_case__							)							) + 1							):
        if num % i == 0:  # If i is a factor of num
            facs.append(snake_case__							)
            _UpperCAmelCase							:						Dict       							=					num // i  # num//i is the other factor of num
            if d != i:  # If d and i are distinct
                facs.append(snake_case__							)  # we have found another factor
    facs.sort()
    return facs


if __name__ == "__main__":
  testmod(name='factors_of_a_number', verbose=True)







"""simple docstring"""
def 				lowerCamelCase_		(UpperCamelCase__	:	List[Any]  , UpperCamelCase__	:	int							):
    sequence.append(UpperCamelCase__							)

    _UpperCAmelCase							:						str       							=					0
    while sequence[index] != target:
        index += 1

    sequence.pop()

    if index == len(UpperCamelCase__							):
        return None

    return index


if __name__ == "__main__":
  _lowerCAmelCase					:Dict  =      input('Enter numbers separated by comma:\n').strip()
  _lowerCAmelCase					:List[Any]  =      [int(item) for item in user_input.split(',')]

  _lowerCAmelCase					:int  =      input('Enter a single number to be found in the list:\n')
  _lowerCAmelCase					:List[Any]  =      int(target_input)
  _lowerCAmelCase					:Optional[int]  =      sentinel_linear_search(sequence, target)
  if result is not None:
    print(f"{target} found at positions: {result}")
  else:
    print('Not found')


