codeforces873b

B. Balanced Substring

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a string s consisting only of characters 0 and 1. A substring [l, r] of s is a string slsl + 1sl + 2... sr, and its length equals tor - l + 1. A substring is called balanced if the number of zeroes (0) equals to the number of ones in this substring.

You have to determine the length of the longest balanced substring of s.

Input

The first line contains n (1 ≤ n ≤ 100000) — the number of characters in s.

The second line contains a string s consisting of exactly n characters. Only characters 0 and 1 can appear in s.

Output

If there is no non-empty balanced substring in s, print 0. Otherwise, print the length of the longest balanced substring.

Examples

input

8
11010111

output

4

input

3
111

output

0

题意：输入一个01字符串，找出其中1和0数量一样多的最长子串。

思路：设一个量为num，初始为0，遍历字符串每遇到1则num++，每遇到0则num--，每个位都有对应的num值，两个对应num值的位之间的0和1数量相等，num=0位为从开始到这个位的0和1数量相等。

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<vector>
using namespace std;
char s[100005];
vector<int>g1[100005];
vector<int>g2[100005];
int main()
{
	int n;
	while(~scanf("%d",&n))
	{
		for(int i=0;i<100005;i++)
		{
			g1[i].clear();
			g2[i].clear();
		}
		scanf("%s",s);
		int x=0;
		for(int i=0;i<n;i++)
		{
			if(s[i]=='1')
			{
				x++;
				if(x>=0)
				{
					g1[x].push_back(i);
				}
				else g2[-x].push_back(i);
			}
			else if(s[i]=='0')
			{
				x--;
				if(x>=0)g1[x].push_back(i);
				else g2[-x].push_back(i);
			}
		}
		int ans=0;
		for(int i=0;i<g1[0].size();i++)ans=max(ans,g1[0][i]+1);
		for(int i=1;i<n;i++)
		{
			int min1=1000005,max1=-1000005;
			for(int j=0;j<g1[i].size();j++)
			{
				min1=min(min1,g1[i][j]);
				max1=max(max1,g1[i][j]);
			}
			int min2=1000005,max2=-1000005;
			for(int j=0;j<g2[i].size();j++)
			{
				min2=min(min2,g2[i][j]);
				max2=max(max2,g2[i][j]);
			}
			ans=max(ans,max(max1-min1,max2-min2));
		}
		printf("%d\n",ans);
	}
}