



def 	UpperCamelCase			(     snake_case__ :					str			)			->  int:
   UpperCamelCase					:						Any					=			len(snake_case__			)
   UpperCamelCase					:						Union[str, Any]					=			[0] * length
   UpperCamelCase					:						List[Any]					=			[[False for i in range(snake_case__			)] for j in range(snake_case__			)]
   for i, c in enumerate(snake_case__			):
      UpperCamelCase					:						Tuple					=			i
      for j in range(i + 1			):
         if c == string[j] and (i - j < 2 or is_palindromic[j + 1][i - 1]):
            UpperCamelCase					:						Optional[int]					=			True
            UpperCamelCase					:						Dict					=			min(snake_case__ ,  0 if j == 0 else (cut[j - 1] + 1)			)
      UpperCamelCase					:						Optional[int]					=			mincut
   return cut[length - 1]


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








from __future__ import annotations

import sys
def 	UpperCamelCase			(     snake_case__ :					int ,  snake_case__ :					int			)			->  tuple[int, int]:
   # base cases
   if abs(snake_case__			) == 1:
      return a, 0
   elif abs(snake_case__			) == 1:
      return 0, b

   UpperCamelCase			,  UpperCamelCase					:						Dict					=			a, b
   UpperCamelCase			,  UpperCamelCase					:						int					=			1, 0
   UpperCamelCase			,  UpperCamelCase					:						Union[str, Any]					=			0, 1

   while remainder != 0:
      UpperCamelCase					:						str					=			old_remainder // remainder
      UpperCamelCase			,  UpperCamelCase					:						Union[str, Any]					=			remainder, old_remainder - quotient * remainder
      UpperCamelCase			,  UpperCamelCase					:						List[Any]					=			coeff_a, old_coeff_a - quotient * coeff_a
      UpperCamelCase			,  UpperCamelCase					:						Optional[Any]					=			coeff_b, old_coeff_b - quotient * coeff_b

   # sign correction for negative numbers
   if a < 0:
      UpperCamelCase					:						Dict					=			-old_coeff_a
   if b < 0:
      UpperCamelCase					:						Any					=			-old_coeff_b

   return old_coeff_a, old_coeff_b
def 	UpperCamelCase			(     )			->  Tuple:
   if len(sys.argv			) < 3:
      print('2 integer arguments required'			)
      return 1
   UpperCamelCase					:						Union[str, Any]					=			int(sys.argv[1]			)
   UpperCamelCase					:						Optional[int]					=			int(sys.argv[2]			)
   print(extended_euclidean_algorithm(snake_case__ ,  snake_case__			)			)
   return 0


if __name__ == "__main__":
    raise SystemExit(main())



