


'''simple docstring'''



import itertools






def 						lowerCamelCase							(_SCREAMING_SNAKE_CASE   :     int = 1_000_000     ):
					__a    : str      					=						[1]

					for i in itertools.count(len(_SCREAMING_SNAKE_CASE     )     ):
										__a    : Dict      					=						0
										for j in itertools.count(1     ):
															__a    : int      					=						-1 if j % 2 == 0 else +1
															__a    : Optional[int]      					=						(j * j * 3 - j) // 2
															if index > i:
																				break
															item += partitions[i - index] * sign
															item %= number
															index += j
															if index > i:
																				break
															item += partitions[i - index] * sign
															item %= number

										if item == 0:
															return i
										partitions.append(_SCREAMING_SNAKE_CASE     )

					return 0


if __name__ == "__main__":
	import doctest

	doctest.testmod()

	print(f'''{solution() = }''')







'''simple docstring'''



def 						lowerCamelCase							(_SCREAMING_SNAKE_CASE   :     set		,   _SCREAMING_SNAKE_CASE   :     set     ):
					assert isinstance(_SCREAMING_SNAKE_CASE		,   _SCREAMING_SNAKE_CASE     ), F"""The input value of [set_a={set_a}] is not a set"""
					assert isinstance(_SCREAMING_SNAKE_CASE		,   _SCREAMING_SNAKE_CASE     ), F"""The input value of [set_b={set_b}] is not a set"""

					return {a + b for a in set_a for b in set_b}


if __name__ == "__main__":
	from doctest import testmod

	testmod()



