from collections import defaultdict
from math import gcd





def  _lowerCamelCase					(   a_				: int = 1_50_00_00):
			lowerCamelCase						:defaultdict						  =     defaultdict(a_)
			lowerCamelCase						:Optional[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						:Dict						  =     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_				: int = 4_00_00_00):
			lowerCamelCase						:Dict						  =     [0, 1]
			lowerCamelCase						:Optional[Any]						  =     0
			while fib[i] <= n:
						fib.append(fib[i] + fib[i + 1])
						if fib[i + 2] > n:
									break
						i += 1
			lowerCamelCase						:Dict						  =     0
			for j in range(len(a_) - 1):
						if fib[j] % 2 == 0:
									total += fib[j]

			return total


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



