题目描述

Byteasar studies certain strings of zeroes and ones.
Let  be such a string. By  we will denote the reversed (i.e., "read backwards") string , and by  we will denote the string obtained from  by changing all the zeroes to ones and ones to zeroes.
Byteasar is interested in antisymmetry, while all things symmetric bore him.
Antisymmetry however is not a mere lack of symmetry.
We will say that a (nonempty) string  is antisymmetric if, for every position  in , the -th last character is different than the -th (first) character.
In particular, a string  consisting of zeroes and ones is antisymmetric if and only if .
For example, the strings 00001111 and 010101 are antisymmetric, while 1001 is not.
In a given string consisting of zeroes and ones we would like to determine the number of contiguous nonempty antisymmetric fragments.
Different fragments corresponding to the same substrings should be counted multiple times.
给一个01串，找出最长的反对称回文串，即相对位置0对1,1对0，求这个长度

输入格式：

The first line of the standard input contains an integer  () that denotes the length of the string.
The second line gives a string of 0 and/or 1 of length .
There are no spaces in the string.

输出格式：

The first and only line of the standard output should contain a single integer, namely the number of contiguous (non empty) fragments of the given string that are antisymmetric.

输入样例#1：

8
11001011

输出样例#1：

7