Smallest Length After Palindrome Substring Removals

You are given a string s consisting of lowercase letters. In one move, you can remove any substring of s that is a palindrome. You may perform this operation any number of times (possibly zero). The goal is to determine the smallest possible length of the remaining string after performing these operations.

Observation: If the entire string is a palindrome, then you can remove it in one operation, leaving an empty string which has a length of 0. Otherwise, at least one character will remain, so the smallest possible length is 1.

Formally, let \( s \) be the input string. Then the answer is given by:

[ ans = \begin{cases} 0, & \text{if } s = s^R
1, & \text{otherwise} \end{cases} ]

Here, \( s^R \) denotes the reverse of the string \( s \).

inputFormat

The input is provided via standard input (stdin) as a single line containing the string s (with no spaces) whose length is at least 1 and at most \(10^5\).

outputFormat

Output via standard output (stdout) a single integer: 0 if the string is a palindrome and can be removed entirely, or 1 otherwise.

a

0