"""simple docstring"""



from __future__ import annotations

from pathlib import Path
def 						_SCREAMING_SNAKE_CASE			(   __snake_case      :  tuple[int, int]		, __snake_case      :  tuple[int, int]   ):





  '''simple docstring'''





  return pointa[0] * pointa[1] - pointa[1] * pointa[0]
def 						_SCREAMING_SNAKE_CASE			(   __snake_case      :  int		, __snake_case      :  int		, __snake_case      :  int		, __snake_case      :  int		, __snake_case      :  int		, __snake_case      :  int   ):





  '''simple docstring'''





  lowercase							   =	(xa, ya)
  lowercase							   =	(xa - xa, ya - ya)
  lowercase							   =	(xa - xa, ya - ya)
  lowercase							   =	-vector_product(__snake_case		, __snake_case   ) / vector_product(
      __snake_case		, __snake_case   )
  lowercase							   =	+vector_product(__snake_case		, __snake_case   ) / vector_product(
      __snake_case		, __snake_case   )

  return a > 0 and b > 0 and a + b < 1
def 						_SCREAMING_SNAKE_CASE			(   __snake_case      :  str = "p102_triangles.txt"   ):





  '''simple docstring'''





  lowercase							   =	Path(__snake_case   ).parent.joinpath(__snake_case   ).read_text(encoding='utf-8'   )

  lowercase							   =	[]
  for line in data.strip().split('\n'   ):
    triangles.append([int(__snake_case   ) for number in line.split(','   )]   )

  lowercase							   =	0
  lowercase							   =	42

  for triangle in triangles:
    ret += contains_origin(*__snake_case   )

  return ret


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










"""simple docstring"""



def 						_SCREAMING_SNAKE_CASE			(   __snake_case      :  str   ):





  '''simple docstring'''





  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		:  List[Any]						=		find_minimum_partitions(s)
    print(F'''Minimum number of partitions required for the \'{s}\' is {ans}''')


