'''simple docstring'''




def __lowerCAmelCase				(							UpperCamelCase__       ,						UpperCamelCase__       ,						UpperCamelCase__       ,						UpperCamelCase__       ,						UpperCamelCase__       )			->					None:
    if target == 0:
        answer.append(path.copy()       )
    else:
        for index in range(UpperCamelCase__       ,						len(UpperCamelCase__       )       ):
            if target >= candidates[index]:
                path.append(candidates[index]       )
                backtrack(UpperCamelCase__       ,						UpperCamelCase__       ,						UpperCamelCase__       ,						target - candidates[index]       ,						UpperCamelCase__       )
                path.pop(len(UpperCamelCase__       ) - 1       )






def __lowerCAmelCase				(							UpperCamelCase__       ,						UpperCamelCase__       )			->					list:
    __lowerCamelCase						=						[]  # type: list[int]
    __lowerCamelCase						=						[]  # type: list[int]
    backtrack(UpperCamelCase__       ,						UpperCamelCase__       ,						UpperCamelCase__       ,						UpperCamelCase__       ,						0       )
    return answer






def __lowerCAmelCase				(							)			->					None:
    print(combination_sum([-8, 2.3, 0]       ,						1       )       )


if __name__ == "__main__":
  import doctest

  doctest.testmod()
  main()

'''simple docstring'''




def __lowerCAmelCase				(							UpperCamelCase__       )			->					int:
    __lowerCamelCase						=						len(UpperCamelCase__       )
    __lowerCamelCase						=						[0] * length
    __lowerCamelCase						=						[[False for i in range(UpperCamelCase__       )] for j in range(UpperCamelCase__       )]
    for i, c in enumerate(UpperCamelCase__       ):
        __lowerCamelCase						=						i
        for j in range(i + 1       ):
            if c == string[j] and (i - j < 2 or is_palindromic[j + 1][i - 1]):
                __lowerCamelCase						=						True
                __lowerCamelCase						=						min(UpperCamelCase__       ,						0 if j == 0 else (cut[j - 1] + 1)       )
        __lowerCamelCase						=						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}')
