Semi Alternating Substring :
Difficulty Level : Medium
Submissions : 378
Asked In :
Marks :100
: 4 | : 0
Given a string S containing only character a and b . A substring (contiguous fragment) of s is called semi-alternating substring if it doest not contains three identical consecutive characters. In other words, It does not contain either 'aaa' or 'bbb' substring .
Note that te wholse S is its own substring
Input
First line of test case contains a string S ($$$1\le S \le 10^5$$$)
Output
For each output print the longest semi-alternating substring
Examples
Input
abaaaa
Output
4
Input
babba
Output
5
