Codeforces Round #505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) C (转化)

C. Plasticine zebra

time limit per test

1 second

memory limit per test

256 megabytes

Is there anything better than going to the zoo after a tiresome week at work? No wonder Grisha feels the same while spending the entire weekend accompanied by pretty striped zebras.

Inspired by this adventure and an accidentally found plasticine pack (represented as a sequence of black and white stripes), Grisha now wants to select several consequent (contiguous) pieces of alternating colors to create a zebra. Let's call the number of selected pieces the length of the zebra.

Before assembling the zebra Grisha can make the following operation 0or more times. He splits the sequence in some place into two parts, then reverses each of them and sticks them together again. For example, if Grisha has pieces in the order "bwbbw" (here 'b' denotes a black strip, and 'w' denotes a white strip), then he can split the sequence as bw|bbw (here the vertical bar represents the cut), reverse both parts and obtain "wbwbb".

Determine the maximum possible length of the zebra that Grisha can produce.

Input

The only line contains a string s(1≤|s|≤105, where |s| denotes the length of the string s) comprised of lowercase English letters 'b' and 'w' only, where 'w' denotes a white piece and 'b' denotes a black piece.

Output

Print a single integer — the maximum possible zebra length.

Examples

Input

bwwwbwwbw

Output

5

Input

bwwbwwb

Output

3

Note

In the first example one of the possible sequence of operations is bwwwbww|bw →w|wbwwwbwb → wbwbwwwbw, that gives the answer equal to 5.

In the second example no operation can increase the answer.

题目大意：给定一个字符串，定义“长度”为字符串中能得到的 b 、w 交替出现的子串（如...bwbw...或...wbw...）的最大长度。为此，我们可以对字符串进行一种操作以得到最大的“长度“，即选取一个位置，将两边的字符串反转，如：bww|bw -> wwbwb。该操作可以执行多次，问能得到的最大“长度”。

思路：其实可以将字符串看成是首尾相连的一个环，选择位置反转其实就是在环中选一个位置将环打开，这样只要沿着环扫一次就可以得到最大值。需要注意的是环要绕两圈才能保证考虑所有情况，如果答案正好等于字符串长度的话，两圈算的时候是连着的，按照思路算下来是2倍（如：bwbw），将结果除2即可。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 1e5 + 5;
char in[maxn];
int main()
{
    scanf("%s",&in);
    int len = strlen(in);
    int sum = len << 1;
    int ans = 1;
    int i = 1;
    while(i < sum)
    {
        int temp = 1;
        if(in[i % len] != in[(i - 1) % len])
        {
            while(i < sum && in[i % len] != in[(i - 1) % len])
                ++i,++temp;
        }
        ++i;
        ans = max(ans,temp);
    }
    if(ans > len) ans >>= 1;
    printf("%d\n",ans);
    return 0;
}