
"""simple docstring"""


def      lowerCAmelCase_     (	snake_case_	:    int = 1_0_0_0    )     ->int:
			lowerCamelCase__			:  List[Any]  =0
			lowerCamelCase__			:  Any  =0
			while 1:
						num += 3
						if num >= n:
									break
						total += num
						num += 2
						if num >= n:
									break
						total += num
						num += 1
						if num >= n:
									break
						total += num
						num += 3
						if num >= n:
									break
						total += num
						num += 1
						if num >= n:
									break
						total += num
						num += 2
						if num >= n:
									break
						total += num
						num += 3
						if num >= n:
									break
						total += num
			return total


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

"""simple docstring"""


def      lowerCAmelCase_     (	snake_case_	:    str    )     ->int:
			lowerCamelCase__			:  Optional[Any]  =len(snake_case_    )
			lowerCamelCase__			:  Any  =[0] * length
			lowerCamelCase__			:  str  =[[False for i in range(snake_case_    )] for j in range(snake_case_    )]
			for i, c in enumerate(snake_case_    ):
						lowerCamelCase__			:  Optional[Any]  =i
						for j in range(i + 1    ):
									if c == string[j] and (i - j < 2 or is_palindromic[j + 1][i - 1]):
												lowerCamelCase__			:  int  =True
												lowerCamelCase__			:  Tuple  =min(snake_case_							,					0 if j == 0 else (cut[j - 1] + 1)    )
						lowerCamelCase__			:  Any  =mincut
			return cut[length - 1]


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