class     lowerCAmelCase__     :


		'''simple docstring'''






		def __init__(       self     :     str     ,  snake_case__     :     Any     ,  snake_case__     :     List[Any]     ,  snake_case__     :     Optional[Any]		)      ->	Optional[int]:
				_lowerCamelCase				   =  name
				_lowerCamelCase				   =  value
				_lowerCamelCase				   =  weight
		def __repr__(       self     :     Union[str, Any]		)      ->	Optional[int]:
				return f"""{self.__class__.__name__}({self.name}, {self.value}, {self.weight})"""
		def   _snake_case       (       self     :     List[Any]		)      ->	int:
				return self.value
		def   _snake_case       (       self     :     List[Any]		)      ->	int:
				return self.name
		def   _snake_case       (       self     :     Union[str, Any]		)      ->	int:
				return self.weight



		def   _snake_case       (       self     :     Optional[Any]		)      ->	List[Any]:
				return self.value / self.weight



def 	lowerCamelCase					(	UpperCamelCase     :				List[Any]			,       UpperCamelCase     :				Optional[Any]			,       UpperCamelCase     :				Optional[int]							)   ->    int:
		_lowerCamelCase				   =  []
		for i in range(len(UpperCamelCase							)							):
				menu.append(Things(name[i]			,       value[i]			,       weight[i]							)							)
		return menu


def 	lowerCamelCase					(	UpperCamelCase     :				Tuple			,       UpperCamelCase     :				Any			,       UpperCamelCase     :				Any							)   ->    int:
		_lowerCamelCase				   =  sorted(UpperCamelCase			,       key=UpperCamelCase			,       reverse=UpperCamelCase							)
		_lowerCamelCase				   =  []
		_lowerCamelCase   ,							_lowerCamelCase				   =  0.0, 0.0
		for i in range(len(UpperCamelCase							)							):
				if (total_cost + items_copy[i].get_weight()) <= max_cost:
						result.append(items_copy[i]							)
						total_cost += items_copy[i].get_weight()
						total_value += items_copy[i].get_value()
		return (result, total_value)


def 	lowerCamelCase					(	)   ->    Optional[Any]:
		pass


if __name__ == "__main__":
				import doctest

				doctest.testmod()
def 	lowerCamelCase					(	UpperCamelCase     :				int							)   ->    bool:
		_lowerCamelCase				   =  (1 + 24 * n) ** 0.5
		return ((1 + root) / 6) % 1 == 0


def 	lowerCamelCase					(	UpperCamelCase     :				int = 50_00							)   ->    int:
		_lowerCamelCase				   =  [(i * (3 * i - 1)) // 2 for i in range(1			,       UpperCamelCase							)]
		for i, pentagonal_i in enumerate(UpperCamelCase							):
				for j in range(UpperCamelCase			,       len(UpperCamelCase							)							):
						_lowerCamelCase				   =  pentagonal_nums[j]
						_lowerCamelCase				   =  pentagonal_i + pentagonal_j
						_lowerCamelCase				   =  pentagonal_j - pentagonal_i
						if is_pentagonal(UpperCamelCase							) and is_pentagonal(UpperCamelCase							):
								return b

		return -1


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