'''simple docstring'''


def    _lowerCamelCase       ( lowerCamelCase_   :				Tuple      ,	lowerCamelCase_   :				str  ):



     """simple docstring"""





     UpperCAmelCase_				:  List[str]  = len(_UpperCamelCase  )
     # Create a stack and push index of fist element to it
     UpperCAmelCase_				:  Optional[Any]  = []
     st.append(0  )

     # Span value of first element is always 1
     UpperCAmelCase_				:  List[str]  = 1

     # Calculate span values for rest of the elements
     for i in range(1      ,	_UpperCamelCase  ):
          # Pop elements from stack while stack is not
          # empty and top of stack is smaller than price[i]
          while len(_UpperCamelCase  ) > 0 and price[st[0]] <= price[i]:
               st.pop()

          # If stack becomes empty, then price[i] is greater
          # than all elements on left of it, i.e. price[0],
          # price[1], ..price[i-1]. Else the price[i]  is
          # greater than elements after top of stack
          UpperCAmelCase_				:  Optional[int]  = i + 1 if len(_UpperCamelCase  ) <= 0 else (i - st[0])

          # Push this element to stack
          st.append(_UpperCamelCase  )


def    _lowerCamelCase       ( lowerCamelCase_   :				Tuple      ,	lowerCamelCase_   :				Optional[int]  ):



     """simple docstring"""





     for i in range(0      ,	_UpperCamelCase  ):
          print(arr[i]      ,	end=' '  )


# Driver program to test above function
snake_case__	:     List[str]      =    [10, 4, 5, 90, 120, 80]
snake_case__	:     Tuple      =    [0 for i in range(len(price) + 1)]

# Fill the span values in array S[]
calculation_span(price, S)





print_array(S, len(price))









def  snake_case_(_UpperCamelCase	)				->      int:



  """simple docstring"""






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


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

