A mysterious circular arrangement of black stones and white stones has appeared. Ming has been tasked with balancing the stones so that only one black and one white stone remain.
Ming has two operations for balancing the stones:
Take some consecutive sequence of stones where there is exactly one more black stone than a white stone and replace the stones with a single black stone
Take some consecutive sequence of stones where there is exactly one more white stone than black stone and replace the stones with a single white stone
Given a circular arrangement, determine if it is possible for Ming to balance the stones.
Each input will consist of a single test case. Note that your program may be run multiple times on different inputs. The input will consist of a single string $s$ ($1 \le |s| \le 10^5$), with only the characters capital â€˜Bâ€™ and â€˜Wâ€™. The stones are arranged in a circle, so the first stone and the last stone are adjacent.
Output $1$ if it is possible for Ming to balance the stones with his rules. Otherwise, output $0$.
Sample Input 1 | Sample Output 1 |
---|---|
WWBWBB |
1 |
Sample Input 2 | Sample Output 2 |
---|---|
WWWWBBW |
0 |
Sample Input 3 | Sample Output 3 |
---|---|
WBBBBBWWBW |
0 |