




"""simple docstring"""






from itertools import combinations, product



def SCREAMING_SNAKE_CASE__    (     __UpperCAmelCase ,					__UpperCAmelCase ,					__UpperCAmelCase ,					__UpperCAmelCase				)						->						str:







   if xa == ya == 0 or xa == ya == 0:
      return False
   lowercase__:     Union[str, Any]      =   xa * xa + ya * ya
   lowercase__:     List[Any]      =   xa * xa + ya * ya
   lowercase__:     str      =   (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 SCREAMING_SNAKE_CASE__    (     __UpperCAmelCase = 5_0				)						->						Optional[int]:
   return sum(
       1
       for pta, pta in combinations(product(range(limit + 1				) ,					repeat=2				) ,					2				)
       if is_right(*__UpperCAmelCase ,					*__UpperCAmelCase				)				)


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

"""simple docstring"""






def SCREAMING_SNAKE_CASE__    (     __UpperCAmelCase = 1_0_0_0				)						->						int:
   lowercase__:     Union[str, Any]      =   0
   lowercase__:     Any      =   0
   while 1:
      num += 3
      if num >= n:
         break
      total += num
      num += 2
      if num >= n:
         break
      total += num
      num += 1
      if num >= n:
         break
      total += num
      num += 3
      if num >= n:
         break
      total += num
      num += 1
      if num >= n:
         break
      total += num
      num += 2
      if num >= n:
         break
      total += num
      num += 3
      if num >= n:
         break
      total += num
   return total


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