





"""simple docstring"""


def     lowercase__			(    lowercase_						,lowercase_	)    ->						Optional[Any]:




      """simple docstring"""

      sequence.append(__A	)

      _UpperCamelCase					:		Tuple  =				0
      while sequence[index] != target:
            index += 1

      sequence.pop()

      if index == len(__A	):
            return None

      return index


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

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



from math import sqrt





def 	snake_case_      (__A     :						int     )			->	list[int]:
   __lowerCAmelCase  :			List[str]					    =						[1]
   for i in range(2					,   int(sqrt(__A     )     ) + 1					,   1     ):
      if number % i == 0:
         values.append(__A     )
         if int(number // i     ) != i:
            values.append(int(number // i     )     )
   return sorted(__A     )





def 	snake_case_      (__A     :						int     )			->	bool:
   return sum(factors(__A     )     ) > n





def 	snake_case_      (__A     :						int     )			->	bool:
   __lowerCAmelCase  :			Any					    =						factors(__A     )
   __lowerCAmelCase  :			Union[str, Any]					    =						len(__A     )
   __lowerCAmelCase  :			str					    =						[[0 for i in range(number + 1     )] for j in range(r + 1     )]
   for i in range(r + 1     ):
      __lowerCAmelCase  :			Tuple					    =						True

   for i in range(1					,   number + 1     ):
      __lowerCAmelCase  :			List[str]					    =						False

   for i in range(1					,   r + 1     ):
      for j in range(1					,   number + 1     ):
         if j < values[i - 1]:
            __lowerCAmelCase  :			Dict					    =						subset[i - 1][j]
         else:
            __lowerCAmelCase  :			Dict					    =						subset[i - 1][j] or subset[i - 1][j - values[i - 1]]

   return subset[r][number] != 0





def 	snake_case_      (__A     :						int     )			->	bool:
   return abundant(__A     ) and not semi_perfect(__A     )


if __name__ == "__main__":
   import doctest

   doctest.testmod(verbose=True)
   for number in (69, 70, 71):
      print(F'{number} is {"" if weird(number) else "not "}weird.')


