


from collections import defaultdict
from math import gcd





def __UpperCAmelCase							(		__A = 1_5_0_0_0_0_0      )    ->       int:



       '''simple docstring'''





       UpperCAmelCase__					    =  defaultdict(SCREAMING_SNAKE_CASE_      )
       UpperCAmelCase__					    =  2
       while 2 * euclid_m * (euclid_m + 1) <= limit:
              for euclid_n in range((euclid_m % 2) + 1			,    SCREAMING_SNAKE_CASE_			,    2      ):
                     if gcd(SCREAMING_SNAKE_CASE_			,    SCREAMING_SNAKE_CASE_      ) > 1:
                            continue
                     UpperCAmelCase__					    =  2 * euclid_m * (euclid_m + euclid_n)
                     for perimeter in range(SCREAMING_SNAKE_CASE_			,    limit + 1			,    SCREAMING_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'''
import numpy as np





def 			lowerCamelCase(							SCREAMING_SNAKE_CASE_     )		->		np.array:
			return 1 / (1 + np.exp(-vector     ))





def 			lowerCamelCase(							SCREAMING_SNAKE_CASE_     )		->		np.array:
			return vector * sigmoid(1.702 * vector     )


if __name__ == "__main__":
							import doctest

							doctest.testmod()




