






def 		_a					(   a				:str				)							->    int:
	a							=   len(a				)
	a							=   [0] * length
	a							=   [[False for i in range(a				)] for j in range(a				)]
	for i, c in enumerate(a				):
		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(a			,							0 if j == 0 else (cut[j - 1] + 1)				)
		a							=   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}""")










def 		_a					(   a				:float				)							->    float:
 return -num if num < 0 else num
def 		_a					(   a				:list[int]				)							->    int:
 if len(a				) == 0:
  raise ValueError('''abs_min() arg is an empty sequence'''				)
 a							=   x[0]
 for i in x:
  if abs_val(a				) < abs_val(a				):
   a							=   i
 return j
def 		_a					(   a				:list[int]				)							->    int:
 if len(a				) == 0:
  raise ValueError('''abs_max() arg is an empty sequence'''				)
 a							=   x[0]
 for i in x:
  if abs(a				) > abs(a				):
   a							=   i
 return j
def 		_a					(   a				:list[int]				)							->    int:
 if len(a				) == 0:
  raise ValueError('''abs_max_sort() arg is an empty sequence'''				)
 return sorted(a			,							key=a				)[-1]
def 		_a					(   )							->    int:
 assert abs_val(0				) == 0
 assert abs_val(34				) == 34
 assert abs_val(-100_000_000_000				) == 100_000_000_000

 a							=   [-3, -1, 2, -11]
 assert abs_max(a				) == -11
 assert abs_max_sort(a				) == -11
 assert abs_min(a				) == -1


if __name__ == "__main__":
     import doctest

     doctest.testmod()

     test_abs_val()
     print(abs_val(-34))  # --> 34


