





'''simple docstring'''




def 	__lowerCamelCase (  UpperCAmelCase_       )      ->int:
	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__				: int									=    input('''Enter the string: ''').strip()
			a__				: List[Any]									=    find_minimum_partitions(s)
			print(f"""Minimum number of partitions required for the '{s}' is {ans}""")










'''simple docstring'''




def 	__lowerCamelCase (  UpperCAmelCase_       )      ->int:
	return 1 if input_a == 0 else 0




def 	__lowerCamelCase (  )      ->None:
	assert not_gate(0       ) == 1
	assert not_gate(1       ) == 0


if __name__ == "__main__":
			print(not_gate(0))
			print(not_gate(1))



