



'''simple docstring'''




from __future__ import annotations

lowerCamelCase							:int       = 8.988E9  # units = N * m^s * C^-2



def      a      (			lowerCamelCase__						,				lowerCamelCase__						,				lowerCamelCase__						,				lowerCamelCase__   ):
			'''simple docstring'''





			A_     :						Any     =					abs(chargea * chargea   )

			if (force, chargea, chargea, distance).count(0   ) != 1:
						raise ValueError("""One and only one argument must be 0"""   )
			if distance < 0:
						raise ValueError("""Distance cannot be negative"""   )
			if force == 0:
						A_     :						List[Any]     =					COULOMBS_CONSTANT * charge_product / (distance**2)
						return {"force": force}
			elif chargea == 0:
						A_     :						Optional[int]     =					abs(a__   ) * (distance**2) / (COULOMBS_CONSTANT * chargea)
						return {"charge1": chargea}
			elif chargea == 0:
						A_     :						Optional[int]     =					abs(a__   ) * (distance**2) / (COULOMBS_CONSTANT * chargea)
						return {"charge2": chargea}
			elif distance == 0:
						A_     :						str     =					(COULOMBS_CONSTANT * charge_product / abs(a__   )) ** 0.5
						return {"distance": distance}
			raise ValueError("""Exactly one argument must be 0"""   )


if __name__ == "__main__":
			import doctest

			doctest.testmod()




'''simple docstring'''




from __future__ import annotations

from functools import lru_cache
from math import ceil

lowerCamelCase							:List[str]       = 1_0_0

lowerCamelCase							:Dict       = set(range(3, NUM_PRIMES, 2))
primes.add(2)
lowerCamelCase							:int

for prime in range(3, ceil(NUM_PRIMES**0.5), 2):
						if prime not in primes:
												continue
						primes.difference_update(set(range(prime * prime, NUM_PRIMES, prime)))



@lru_cache(maxsize=1_00   )
def      a      (			lowerCamelCase__   ):
			'''simple docstring'''





			if number_to_partition < 0:
						return set()
			elif number_to_partition == 0:
						return {1}

			A_     :						set[int]     =					set()
			A_     :						int
			A_     :						int

			for prime in primes:
						if prime > number_to_partition:
									continue
						for sub in partition(number_to_partition - prime   ):
									ret.add(sub * prime   )

			return ret



def      a      (			lowerCamelCase__ = 50_00   ):
			'''simple docstring'''





			for number_to_partition in range(1						,				lowerCamelCase__   ):
						if len(partition(lowerCamelCase__   )   ) > number_unique_partitions:
									return number_to_partition
			return None


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