"""simple docstring"""






import itertools



def     a_		(   lowerCamelCase = 1_0_0_0_0_0_0			):
				UpperCAmelCase__			 =				[1]

				for i in itertools.count(len(lowerCamelCase_			)			):
								UpperCAmelCase__			 =				0
								for j in itertools.count(1			):
												UpperCAmelCase__			 =				-1 if j % 2 == 0 else +1
												UpperCAmelCase__			 =				(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(lowerCamelCase_			)

				return 0


if __name__ == "__main__":
						import doctest

						doctest.testmod()

						print(F"""{solution() = }""")











"""simple docstring"""







from itertools import combinations, product





def 							SCREAMING_SNAKE_CASE							(   lowerCamelCase_			,  lowerCamelCase_			,  lowerCamelCase_			,  lowerCamelCase_):
					if xa == ya == 0 or xa == ya == 0:
										return False
					a__ 							=	xa * xa + ya * ya
					a__ 							=	xa * xa + ya * ya
					a__ 							=	(xa - xa) * (xa - xa) + (ya - ya) * (ya - ya)
					return (
					    a_square + b_square == c_square
					    or a_square + c_square == b_square
					    or b_square + c_square == a_square
					)





def 							SCREAMING_SNAKE_CASE							(   lowerCamelCase_ = 50):
					return sum(
					    1
					    for pta, pta in combinations(product(range(limit + 1)			,  repeat=2)			,  2)
					    if is_right(*lowerCamelCase_			,  *lowerCamelCase_))


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


