code: 
  
  
  from itertools import combinations, product
  
  
  
  
  
  
  def   __lowerCamelCase	(       lowerCamelCase__		:	int     ,       lowerCamelCase__		:	int     ,       lowerCamelCase__		:	int     ,       lowerCamelCase__		:	int			):
  
  
  
  
  
  			'''simple docstring'''
  
  
  
  
  			if xa == ya == 0 or xa == ya == 0:
  						return False
  			lowerCamelCase								=     xa * xa + ya * ya
  			lowerCamelCase								=     xa * xa + ya * ya
  			lowerCamelCase								=     (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   __lowerCamelCase	(       lowerCamelCase__		:	int = 50			):
  
  
  
  
  
  			'''simple docstring'''
  
  
  
  
  			return sum(
  			    1
  			    for pta, pta in combinations(product(range(limit + 1			)     ,       repeat=2			)     ,       2			)
  			    if is_right(*lowerCamelCase__     ,       *lowerCamelCase__			)			)
  
  
  if __name__ == "__main__":
  		print(f"""{solution() = }""")
  
  
style_context: 
  
  
  def   __lowerCamelCase	(       lowerCamelCase__		:	int = 100     ,       lowerCamelCase__		:	int = 100			):
  
  
  
  
  
  			'''simple docstring'''
  
  
  
  
  			return max(
  			    sum(int(lowerCamelCase__			) for x in str(base**power			)			)
  			    for base in range(lowerCamelCase__			)
  			    for power in range(lowerCamelCase__			)			)
  
  
  # Tests
  if __name__ == "__main__":
  		import doctest
  
  		doctest.testmod()
  
  