Charlie and his father Robert visited a toy store. Charlie asked his father to buy some toys for him. Robert came up with a small activity to test his son's logical ability. He arranges toys in a specific order and asks Charlie to select any number of toys that are adjacent to each other to meet the below condition, It should be possible to arrange selected toys in an order that follows the same pattern from left to right and right to left. For example, if the order of the toys is 7121928 (each digit indicates a toy), the maximum adjacent toys that can be selected are 12192 because it is possible to arrange the selected toys as 12921 or 21912 that follows the same pattern from left to right and right to left. Robert promises Charlie that if he selects any number of toys following the above condition, he will buy all of those selected toys. Charlie is so excited and wants to select the maximum number of toys. Your task is to find the maximum number of toys Robert has to buy for Charlie. Write a program that reads a string S containing integers and prints the maximum number of toys Robert has to buy for Charlie 16 rit x at I te in n it at Write a program that reads a string S containing integers and prints the maximum number of toys Robert has to buy for Charlie. Input The input will be a single containing a string representing S. Output The output should be a single line containing an integer that is the maximum number of toys Robert has to buy for Charlie. 4 Explanation For example, if the given string S = 51224, . Charlie can select the toys 122, as it is possible to arrange them as 212 that follows the same pattern from left to right and right to left. Charlie can select the toys 224 as it is possible to arrange them as 242 that follows the same pattern from left to right and right to left. . In both cases, the maximum number of toys that Robert has to buy for Charlie is 3. The output should be 3. For example, if the given string S = 51224, J . Charlie can select the toys 122 as it is possible to arrange them as 212 that follows the same pattern from left to right and right to left. . Charlie can select the toys 224, as it is possible to arrange them as 242 that follows the same pattern from left to right and right to left. . In both cases, the maximum number of toys that Robert has to buy for Charlie is 3. The output should be 3. Sample Input 1 51224 Sample Output 1 3 Sample Input 2 3242415 Sample Output 2 5