Problem: 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| ≤ 10^5, 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.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 100;
char s[maxn];
int n;
int main() {
  scanf("%s", s);
  n = strlen(s);
  int beg = 1;
  for (beg; beg < n; beg++) {
    if (s[beg] == s[beg - 1]) {
      beg--;
      break;
    }
  }
  int fron;
  if (beg >= n)
    fron = n;
  else
    fron = beg + 1;
  int L = n - 1, T = 0, ans = fron;
  for (int i = n - 2; i > beg; i--) {
    if (s[i] == s[i + 1]) {
      if (s[L] != s[T]) {
        fron = fron + L - i;
      } else {
        fron = L - i;
      }
      ans = max(ans, fron);
      L = i;
      T = i + 1;
    }
  }
  if (s[L] != s[T]) {
    fron = fron + L - beg;
  } else
    fron = L - beg;
  ans = max(ans, fron);
  printf("%d\n", ans);
  return 0;
}