
def 	a_		(	__lowercase       :     int			)			->  bool:
			return str(__lowercase			) == str(__lowercase			)[::-1]






def 	a_		(	__lowercase       :     int			)			->  int:
			return int(__lowercase			) + int(str(__lowercase			)[::-1]			)






def 	a_		(	__lowercase       :     int = 10_000			)			->  int:
			_snake_case          =      []
			for num in range(1	, __lowercase			):
						_snake_case          =      0
						_snake_case          =      num
						while iterations < 50:
									_snake_case          =      sum_reverse(__lowercase			)
									iterations += 1
									if is_palindrome(__lowercase			):
												break
						else:
									lychrel_nums.append(__lowercase			)
			return len(__lowercase			)


if __name__ == "__main__":
			print(F'{solution() = }')

def 	a_		(	__lowercase       :     List[Any]			)			->  Tuple:
			_snake_case          =      len(__lowercase			)
			for i in range(length - 1			):
						_snake_case          =      i
						for k in range(i + 1	, __lowercase			):
									if collection[k] < collection[least]:
												_snake_case          =      k
						if least != i:
									_snake_case     , _snake_case          =      (collection[i], collection[least])
			return collection


if __name__ == "__main__":
			_lowerCamelCase	:    str          =      input('''Enter numbers separated by a comma:\n''').strip()
			_lowerCamelCase	:    List[Any]          =      [int(item) for item in user_input.split(''',''')]
			print(selection_sort(unsorted))