




'''simple docstring'''



from math import sqrt







def      _UpperCamelCase	(_lowerCamelCase							:       int		)->				Optional[int]:




     '''simple docstring'''





     __snake_case         =					[1]
     for i in range(2				,		int(sqrt(__UpperCamelCase		)		) + 1				,		1		):
          if number % i == 0:
               values.append(__UpperCamelCase		)
               if int(number // i		) != i:
                    values.append(int(number // i		)		)
     return sorted(__UpperCamelCase		)







def      _UpperCamelCase	(_lowerCamelCase							:       str		)->				List[str]:




     '''simple docstring'''





     return sum(factors(__UpperCamelCase		)		) > n







def      _UpperCamelCase	(_lowerCamelCase							:       Any		)->				Union[str, Any]:




     '''simple docstring'''





     __snake_case         =					factors(__UpperCamelCase		)
     __snake_case         =					len(__UpperCamelCase		)
     __snake_case         =					[[0 for i in range(number + 1		)] for j in range(r + 1		)]
     for i in range(r + 1		):
          __snake_case         =					True

     for i in range(1				,		number + 1		):
          __snake_case         =					False

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

     return subset[r][number] != 0







def      _UpperCamelCase	(_lowerCamelCase							:       List[str]		)->				List[str]:




     '''simple docstring'''





     return abundant(__UpperCamelCase		) and not semi_perfect(__UpperCamelCase		)


if __name__ == "__main__":
     import doctest

     doctest.testmod(verbose=True)
     for number in (6_9, 7_0, 7_1):
          print(F"""{number} is {"" if weird(number) else "not "}weird.""")












'''simple docstring'''



def      _UpperCamelCase	(_lowerCamelCase							:       list				,		_lowerCamelCase							:       int		)->				int:




     '''simple docstring'''





     for index, item in enumerate(_lowerCamelCase		):
          if item == target:
               return index
     return -1







def      _UpperCamelCase	(_lowerCamelCase							:       list				,		_lowerCamelCase							:       int				,		_lowerCamelCase							:       int				,		_lowerCamelCase							:       int		)->				int:




     '''simple docstring'''





     if not (0 <= high < len(_lowerCamelCase		) and 0 <= low < len(_lowerCamelCase		)):
          raise Exception('''Invalid upper or lower bound!'''		)
     if high < low:
          return -1
     if sequence[low] == target:
          return low
     if sequence[high] == target:
          return high
     return rec_linear_search(_lowerCamelCase				,		low + 1				,		high - 1				,		_lowerCamelCase		)


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

     UpperCAmelCase_    :					List[str]					      =						int(input('''Enter a single number to be found in the list:\n''').strip())
     UpperCAmelCase_    :					Optional[int]					      =						linear_search(sequence, target)
     if result != -1:
          print(F"""linear_search({sequence}, {target}) = {result}""")
     else:
          print(F"""{target} was not found in {sequence}""")






