"""simple docstring"""


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


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


from ..utils import DummyObject, requires_backends
class   UpperCAmelCase_	(				metaclass=lowercase__   ):
    snake_case_											=      ["""torch""", """transformers""", """k_diffusion"""]
    def __init__(	self			:       Optional[Any]   ,						*_lowercase			:       Optional[int]   ,						**_lowercase			:       List[str]		)						->    Dict:
       requires_backends(self   ,						["torch", "transformers", "k_diffusion"]		)
    @classmethod
    def 		_lowerCamelCase      (	cls			:       Union[str, Any]   ,						*_lowercase			:       Any   ,						**_lowercase			:       List[Any]		)						->    str:
       requires_backends(cls   ,						["torch", "transformers", "k_diffusion"]		)




    @classmethod
    def 		_lowerCamelCase      (	cls			:       Optional[Any]   ,						*_lowercase			:       List[Any]   ,						**_lowercase			:       Any		)						->    Any:
       requires_backends(cls   ,						["torch", "transformers", "k_diffusion"]		)