






from itertools import combinations, product
def 		_a					(   a				:int			,							a				:int			,							a				:int			,							a				:int				)							->    bool:
 if xa == ya == 0 or xa == ya == 0:
  return False
 a							=   xa * xa + ya * ya
 a							=   xa * xa + ya * ya
 a							=   (xa - xa) * (xa - xa) + (ya - ya) * (ya - ya)
 return (
     a_square + b_square == c_square
     or a_square + c_square == b_square
     or b_square + c_square == a_square
 )
def 		_a					(   a				:int = 50				)							->    int:
 return sum(
     1
     for pta, pta in combinations(product(range(limit + 1				)			,							repeat=2				)			,							2				)
     if is_right(*a			,							*a				)				)


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










import numpy as np

UpperCAmelCase__            =	[
    ["a", "b", "c", "d", "e"],
    ["f", "g", "h", "i", "k"],
    ["l", "m", "n", "o", "p"],
    ["q", "r", "s", "t", "u"],
    ["v", "w", "x", "y", "z"],
]






class 	lowercase_      :






      '''simple docstring'''




      def __init__(   self   :		Optional[Any]						)					->None:




       """simple docstring"""


       a							=   np.array(__UpperCAmelCase						)







      def    __lowerCAmelCase      (   self   :		List[str]				,      __UpperCAmelCase   :		str						)					->np.ndarray:




       """simple docstring"""


       a						,  a							=   np.where(letter == self.SQUARE						)
       a							=   np.concatenate([indexa + 1, indexa + 1]						)
       return indexes







      def    __lowerCAmelCase      (   self   :		int				,      __UpperCAmelCase   :		int				,      __UpperCAmelCase   :		int						)					->str:




       """simple docstring"""


       return self.SQUARE[indexa - 1, indexa - 1]







      def    __lowerCAmelCase      (   self   :		Tuple				,      __UpperCAmelCase   :		str						)					->str:




       """simple docstring"""


       a							=   message.lower()
       a							=   message.replace('''j'''				,      '''i'''						)

       a							=   ''''''
       for letter_index in range(len(__UpperCAmelCase						)						):
        if message[letter_index] != " ":
         a							=   self.letter_to_numbers(message[letter_index]						)
         a							=   encoded_message + str(numbers[0]						) + str(numbers[1]						)
        elif message[letter_index] == " ":
         a							=   encoded_message + ''' '''

       return encoded_message







      def    __lowerCAmelCase      (   self   :		Any				,      __UpperCAmelCase   :		str						)					->str:




       """simple docstring"""


       a							=   message.replace(''' '''				,      '''  '''						)
       a							=   ''''''
       for numbers_index in range(int(len(__UpperCAmelCase						) / 2						)						):
        if message[numbers_index * 2] != " ":
         a							=   message[numbers_index * 2]
         a							=   message[numbers_index * 2 + 1]

         a							=   self.numbers_to_letter(int(__UpperCAmelCase						)				,      int(__UpperCAmelCase						)						)
         a							=   decoded_message + letter
        elif message[numbers_index * 2] == " ":
         a							=   decoded_message + ''' '''

       return decoded_message


