0 1子串问题

Hideo Kojima has just quit his job at Konami. Now he is going to find a new place to work. Despite being such a well-known person, he still needs a CV to apply for a job.

During all his career Hideo has produced n games. Some of them were successful, some were not. Hideo wants to remove several of them (possibly zero) from his CV to make a better impression on employers. As a result there should be no unsuccessful game which comes right after successful one in his CV.

More formally, you are given an array s₁, s₂, ..., s_n of zeros and ones. Zero corresponds to an unsuccessful game, one — to a successful one. Games are given in order they were produced, and Hideo can't swap these values. He should remove some elements from this array in such a way that no zero comes right after one.

Besides that, Hideo still wants to mention as much games in his CV as possible. Help this genius of a man determine the maximum number of games he can leave in his CV.

Input

The first line contains one integer number n (1 ≤ n ≤ 100).

The second line contains n space-separated integer numbers s₁, s₂, ..., s_n (0 ≤ s_i ≤ 1). 0 corresponds to an unsuccessful game, 1 — to a successful one.

Output

Print one integer — the maximum number of games Hideo can leave in his CV so that no unsuccessful game comes after a successful one.

Example

Input

4
1 1 0 1

Output

3

Input

6
0 1 0 0 1 0

Output

4

Input

1
0

Output

1

题意:给一个含有0 和 1的数字串，可以任意删除其中的某个元素，1后不能跟0，求操作后的数字串的最大长度

暴力解题，直接前找0后找1，记录最大长度

#include <stdio.h>
#include <algorithm>
using namespace std;
int a[200];
int main()
{
	int n,ans=0;
	scanf("%d",&n);
	for(int i=0; i<n; i++)
	{
		scanf("%d",&a[i]);
	}
	for(int i=0; i<n; i++)
	{
		int ant=0;
		for(int j=0; j<=i; j++)
		{
			if(a[j]==0)
		    	ant++;
		}
		for(int j=i; j<n; j++)
		{
			if(a[j]==1)
			  ant++;
		}
		ans=max(ans,ant);
	}
	printf("%d\n",ans);
	return 0;
}