

"""simple docstring"""



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


if __name__ == "__main__":
 SCREAMING_SNAKE_CASE_       :						Dict					=    input('Enter the string: ').strip()
 SCREAMING_SNAKE_CASE_       :						str					=    find_minimum_partitions(s)
 print(f"""Minimum number of partitions required for the '{s}' is {ans}""")







def  UpperCAmelCase__(    lowerCamelCase_ = 1000	):



			"""simple docstring"""





			return sum(i for i in range(lowerCamelCase_	) if i % 3 == 0 or i % 5 == 0	)


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

