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

C. Plasticine zebra

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 0 or 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

Copy

bwwwbwwbw

Output

Copy

5

Input

Copy

bwwbwwb

Output

Copy

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.

题意：给你一个字符串，你可以把它分成两段，然后每段首尾调换再拼接成新的字符串，问相邻连续不相同的最多有多少个？

思路： 每次变化后会发现代码的首尾会连接起来，我们不妨把首尾直接连起来，然后再变化会发现，无论多少次变化字母的相对的顺序就是不变的，我们只要在这个环中相邻连续不相同的数就行了。

#include <bits/stdc++.h>

#define LL long long
using namespace std;

const int N =2e5+5;;
bool cmp(int a,int b)
{
    return a>b;
}
LL m,n,arr[N+10];
string str,str2[1000000];
int a[N];
int main()
{
    ios::sync_with_stdio(false);

    int t,f=0;
    cin >> str;
    int l=str.length();
    if(l==1)
    {
        cout << 1 << endl;
        return 0;
    }
    int ans=1,z=1;
    for(int i=1; i<3*str.length(); i++)
    {
        //cout << z <<endl;
        if(str[i%l]!=str[(i-1)%l]) z++;
        else
        {
            ans=max(z,ans);
            z=1;
        }
        ans=max(z,ans);
    }

    ans=min(ans,l);
    cout <<ans<< endl;
    return 0;
}