
"""simple docstring"""





from collections import defaultdict
from math import gcd



def  lowerCamelCase__						(     __snake_case = 1_50_00_00      )				->						int:


					"""simple docstring"""





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


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













"""simple docstring"""






from maths.is_square_free import is_square_free
from maths.prime_factors import prime_factors






def      lowercase__ (					lowerCAmelCase__   :			int			)    ->			int:



			'''simple docstring'''
			a__  :	Tuple		 =			prime_factors(lowerCAmelCase__			)
			if is_square_free(lowerCAmelCase__			):
						return -1 if len(lowerCAmelCase__			) % 2 else 1
			return 0


if __name__ == "__main__":
		import doctest

		doctest.testmod()