#include <bits/stdc++.h>

using namespace std;

int main()
{
  char S[100001];
  scanf("%s", S);
  
  int ans = strlen(S);
  int N = ans;
  
  for (int i = 0; i < N - 1; i++) {
    if (S[i] != S[i + 1]) ans = min(ans, max(i + 1, N - i - 1));
  }
  
  printf("%d\n", ans);
  
  return 0;
}

### Prompt

Your task is to create a CPP solution to the following problem:

You are given a string S consisting of `0` and `1`. Find the maximum integer K not greater than |S| such that we can turn all the characters of S into `0` by repeating the following operation some number of times.

* Choose a contiguous segment [l,r] in S whose length is at least K (that is, r-l+1\geq K must be satisfied). For each integer i such that l\leq i\leq r, do the following: if S_i is `0`, replace it with `1`; if S_i is `1`, replace it with `0`.

Constraints

* 1\leq |S|\leq 10^5
* S_i(1\leq i\leq N) is either `0` or `1`.

Input

Input is given from Standard Input in the following format:


S


Output

Print the maximum integer K such that we can turn all the characters of S into `0` by repeating the operation some number of times.

Examples

Input

010


Output

2


Input

100000000


Output

8


Input

00001111


Output

4

### Response

```cpp
#include <bits/stdc++.h>

using namespace std;

int main()
{
  char S[100001];
  scanf("%s", S);
  
  int ans = strlen(S);
  int N = ans;
  
  for (int i = 0; i < N - 1; i++) {
    if (S[i] != S[i + 1]) ans = min(ans, max(i + 1, N - i - 1));
  }
  
  printf("%d\n", ans);
  
  return 0;
}

```