





'''simple docstring'''






from __future__ import annotations

from functools import lru_cache
from math import ceil

__UpperCamelCase					    =	100

__UpperCamelCase					    =	set(range(3, NUM_PRIMES, 2))
primes.add(2)
__UpperCamelCase					    =	42

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=100 )
def 					_a						(       _lowerCamelCase ) ->				set[int]:



			"""simple docstring"""


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

			__snake_case					:      set[int]							      =     set()
			__snake_case					:      int
			__snake_case					:      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 = 5000 ) ->				int | None:



			"""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() = }""")



"""simple docstring"""


def      lowerCamelCase_					(   __lowerCAmelCase							)				->   list:




						'''simple docstring'''



						if len(__lowerCAmelCase							) <= 1:
												return [tuple(__lowerCAmelCase							)]

						lowerCamelCase__   =[]

						def generate(__lowerCAmelCase  ,       __lowerCAmelCase							):
												lowerCamelCase__   =[0] * n
												res.append(tuple(__lowerCAmelCase							)							)

												lowerCamelCase__   =0
												while i < n:
																		if c[i] < i:
																								if i % 2 == 0:
																														lowerCamelCase__   , lowerCamelCase__   =arr[i], arr[0]
																								else:
																														lowerCamelCase__   , lowerCamelCase__   =arr[i], arr[c[i]]
																								res.append(tuple(__lowerCAmelCase							)							)
																								c[i] += 1
																								lowerCamelCase__   =0
																		else:
																								lowerCamelCase__   =0
																								i += 1

						generate(len(__lowerCAmelCase							)  ,       __lowerCAmelCase							)
						return res


if __name__ == "__main__":
	a				=input('Enter numbers separated by a comma:\n').strip()
	a				=[int(item) for item in user_input.split(',')]
	print(heaps(arr))


