Kevin has just recevied his disappointing results on the USA Identification of Cows Olympiad (USAICO) in the form of a binary string of lengthn. Each character of Kevin's string represents Kevin's score on one of thenquestions of the olympiad—'1'for a correctly identified cow and'0'otherwise.

However, all is not lost. Kevin is a big proponent of alternative thinking and believes that his score, instead of being the sum of his points, should be the length of the longest alternating subsequence of his string. Here, we define analternating subsequence

of a string as anot-necessarily contiguoussubsequence where no two consecutive elements are equal. For example,{0, 1, 0, 1},{1, 0, 1}, and{1, 0, 1, 0}are alternating sequences, while{1, 0, 0}and{0, 1, 0, 1, 1}are not.

Kevin, being the sneaky little puffball that he is, is willing to hack into the USAICO databases to improve his score. In order to be subtle, he decides that he will flip exactly one substring—that is, take acontiguous

non-empty substring of his score and change all'0's in that substring to'1's and vice versa. After such an operation, Kevin wants to know the length of the longest possible alternating subsequence that his string could have.