


from collections import defaultdict
from math import gcd






def 					lowerCamelCase_   (	_a = 1_500_000	):




		"""simple docstring"""






		lowerCAmelCase__       :      str   					= defaultdict(_a	)
		lowerCAmelCase__       :      List[Any]   					= 2
		while 2 * euclid_m * (euclid_m + 1) <= limit:
				for euclid_n in range((euclid_m % 2) + 1     ,       _a     ,       2	):
						if gcd(_a     ,       _a	) > 1:
								continue
						lowerCAmelCase__       :      Union[str, Any]   					= 2 * euclid_m * (euclid_m + euclid_n)
						for perimeter in range(_a     ,       limit + 1     ,       _a	):
								frequencies[perimeter] += 1
				euclid_m += 1
		return sum(1 for frequency in frequencies.values() if frequency == 1	)


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






def 					lowerCamelCase_   (	_a	):




		"""simple docstring"""






		if number < 0:
				raise ValueError('''number must not be negative'''	)
		return number & (number - 1) == 0


if __name__ == "__main__":
		import doctest

		doctest.testmod()




