
"""simple docstring"""
from itertools import combinations, product
def 					a__ ( a :					int							,  a :					int							,  a :					int							,  a :					int		):

  """simple docstring"""







  if xa == ya == 0 or xa == ya == 0:
    return False
  _snake_case  :    Any            = xa * xa + ya * ya
  _snake_case  :    Union[str, Any]            = xa * xa + ya * ya
  _snake_case  :    Any            = (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		):

  """simple docstring"""







  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() = }')







def        lowerCamelCase_     (     SCREAMING_SNAKE_CASE ):
			'''simple docstring'''
			SCREAMING_SNAKE_CASE     =       len(SCREAMING_SNAKE_CASE )
			SCREAMING_SNAKE_CASE     =       [0] * length
			SCREAMING_SNAKE_CASE     =       [[False for i in range(SCREAMING_SNAKE_CASE )] for j in range(SCREAMING_SNAKE_CASE )]
			for i, c in enumerate(SCREAMING_SNAKE_CASE ):
						SCREAMING_SNAKE_CASE     =       i
						for j in range(i + 1 ):
									if c == string[j] and (i - j < 2 or is_palindromic[j + 1][i - 1]):
												SCREAMING_SNAKE_CASE     =       True
												SCREAMING_SNAKE_CASE     =       min(SCREAMING_SNAKE_CASE       ,						0 if j == 0 else (cut[j - 1] + 1) )
						SCREAMING_SNAKE_CASE     =       mincut
			return cut[length - 1]


if __name__ == "__main__":
		__A    :				Optional[int]    						=	input("""Enter the string: """).strip()
		__A    :				List[Any]    						=	find_minimum_partitions(s)
		print(f'''Minimum number of partitions required for the \'{s}\' is {ans}''')






