C. Plasticine zebra

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 00 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 ss (1≤|s|≤1051≤|s|≤105, where |s||s| denotes the length of the string ss) 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 55.

In the second example no operation can increase the answer.

 

分析：

贪心处理就行，只要第一个字母和最后一个字母不一样就反转，其实只能翻转一次，因为这个数组是一个环，不管怎么反转还是一个环

代码：

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,i,j,m,ans,lend,str;
    char s[100005];//ss,tt;
    scanf("%s",&s);
    n=strlen(s);
    while(1)
    {
        //printf("sssdff \n");
        str=0;
        for(i=1;i<n;i++)
        {
            if(s[i]==s[i-1])break;
        }
        if(i==n)break;
        //printf("%i=d\n",i);
         lend=i;
            if(s[n-1]!=s[0])
            {
                reverse(s,s+lend);
                reverse(s+lend,s+n);
            }
        else
        {
            break;
        }
    }
    ans=1;
    int tt;
    tt=1;
    for(i=1;i<n;i++)
    {
        if(s[i]!=s[i-1])
            tt++;
        else
        {
            ans=max(ans,tt);
            tt=1;
        }
    }
    ans=max(ans,tt);
    printf("%d\n",ans);
}