




from collections import defaultdict
from math import gcd




def 		SCREAMING_SNAKE_CASE__   (       lowercase = 1500000	)    ->  int:
   snake_case :							defaultdict           =			defaultdict(snake_case_	)
   snake_case :							Any           =			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
         snake_case :							List[Any]           =			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"""



def 						__lowercase	(  snake_case_    :    list		)  ->float:



    '''simple docstring'''







    __A       :		Tuple							=	0
    while len(snake_case_		) > 1:
        __A       :		List[Any]							=	0
        # Consider two files with minimum cost to be merged
        for _ in range(2		):
            __A       :		Dict							=	files.index(min(snake_case_		)		)
            temp += files[min_index]
            files.pop(snake_case_		)
        files.append(snake_case_		)
        optimal_merge_cost += temp
    return optimal_merge_cost


if __name__ == "__main__":
       import doctest

       doctest.testmod()




