This page is still under construction.

Parts of this page are still being built. What you see may change.

Balls of Buma

Time limit3sMemory limit512 MB

Summary
Given a row of colored balls, count the color and insertion position pairs that make the chain reaction remove every ball.
Level

Medium6 of 10

Topics
String, Implementation, Simulation, Two pointers
Solved
No attempts yet

Problem

Balph is learning to play a game called Buma. In this game, he is given a row of colored balls. He has to choose the color of one new ball and the place to insert it (between two balls, or to the left of all the balls, or to the right of all the balls).

When the ball is inserted the following happens repeatedly: if some segment of balls of the same color became longer as a result of a previous action and its length became at least 33, then all the balls of this segment are eliminated.

Consider, for example, a row of balls 'AAABBBWWBB'. Suppose Balph chooses a ball of color 'W' and the place to insert it after the sixth ball, i. e. to the left of the two 'W's. After Balph inserts this ball, the balls of color 'W' are eliminated, since this segment was made longer and has length 33 now, so the row becomes 'AAABBBBB'. The balls of color 'B' are eliminated now, because the segment of balls of color 'B' became longer and has length 55 now. Thus, the row becomes 'AAA'. However, none of the balls are eliminated now, because there is no elongated segment.

Help Balph count the number of possible ways to choose a color of a new ball and a place to insert it that leads to the elimination of all the balls.

Input

The only line contains a non-empty string of uppercase English letters of length at most 3⋅1053 \cdot 10^5. Each letter represents a ball with the corresponding color.

Output

Output the number of ways to choose a color and a position of a new ball in order to eliminate all the balls.

Examples5

  1. Example 1

    Input
    BBWWBB
    
    Expected output
    3
    
  2. Example 2

    Input
    BWWB
    
    Expected output
    0
    
  3. Example 3

    Input
    BBWBB
    
    Expected output
    0
    
  4. Example 4

    Input
    OOOWWW
    
    Expected output
    0
    
  5. Example 5

    Input
    WWWOOOOOOWWW
    
    Expected output
    7