






"""simple docstring"""




def 					_lowerCAmelCase(a   :    Tuple  )      ->       str:
	return str(a_  ) == str(a_  )[::-1]






def 					_lowerCAmelCase(a   :    Dict  )      ->       str:
	return int(a_  ) + int(str(a_  )[::-1]  )






def 					_lowerCAmelCase(a   :    List[Any] = 1_0000  )      ->       Tuple:
	_SCREAMING_SNAKE_CASE						=[]
	for num in range(1			,      a_  ):
		_SCREAMING_SNAKE_CASE						=0
		_SCREAMING_SNAKE_CASE						=num
		while iterations < 50:
			_SCREAMING_SNAKE_CASE						=sum_reverse(a_  )
			iterations += 1
			if is_palindrome(a_  ):
				break
		else:
			lychrel_nums.append(a_  )
	return len(a_  )


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












from __future__ import annotations





def 		__UpperCAmelCase     (	a_				,	a_				,	a_):
							snake_case_           =				list(range(len(a_)))
							snake_case_           =				[v / w for v, w in zip(a_				,	a_)]
							index.sort(key=lambda a_: ratio[i]				,	reverse=a_)

							snake_case_           =				0
							snake_case_           =				[0] * len(a_)
							for i in index:
														if weight[i] <= capacity:
																					snake_case_           =				1
																					max_value += value[i]
																					capacity -= weight[i]
														else:
																					snake_case_           =				capacity / weight[i]
																					max_value += value[i] * capacity / weight[i]
																					break

							return max_value, fractions


if __name__ == "__main__":
	import doctest

	doctest.testmod()





