934 C. A Twisty Movement

A dragon symbolizes wisdom, power and wealth. On Lunar New Year's Day, people model a dragon with bamboo strips and clothes, raise them with rods, and hold the rods high and low to resemble a flying dragon.

A performer holding the rod low is represented by a 1, while one holding it high is represented by a 2. Thus, the line of performers can be represented by a sequence a₁, a₂, ..., a_n.

Little Tommy is among them. He would like to choose an interval [l, r] (1 ≤ l ≤ r ≤ n), then reverse a_l, a_l + 1, ..., a_r so that the length of the longest non-decreasing subsequence of the new sequence is maximum.

A non-decreasing subsequence is a sequence of indices p₁, p₂, ..., p_k, such that p₁ < p₂ < ... < p_k and a_p1 ≤ a_p2 ≤ ... ≤ a_pk. The length of the subsequence is k.

Input

The first line contains an integer n (1 ≤ n ≤ 2000), denoting the length of the original sequence.

The second line contains n space-separated integers, describing the original sequence a₁, a₂, ..., a_n (1 ≤ a_i ≤ 2, i = 1, 2, ..., n).

Output

Print a single integer, which means the maximum possible length of the longest non-decreasing subsequence of the new sequence.

Examples

Input

4
1 2 1 2

Output

4

Input

10
1 1 2 2 2 1 1 2 2 1

Output

9

Note

In the first example, after reversing [2, 3], the array will become [1, 1, 2, 2], where the length of the longest non-decreasing subsequence is 4.

In the second example, after reversing [3, 7], the array will become [1, 1, 1, 1, 2, 2, 2, 2, 2, 1], where the length of the longest non-decreasing subsequence is 9.

思路：dp

很容易想到要预处理出1的前缀和pre[i]和2的后缀和suf[i]

然后枚举区间，对于每个区间如果能求出最长递减序列的长度，那么就能更新答案了

这个用dp求

状态：

dp[i][j][0]表示i--j区间以2结尾的最长递减序列长度，很明显这个序列全为2，所以也就是i--j区间2的个数

dp[i][j][1]表示i--j区间以1结尾的最长递减序列长度

状态转移：

dp[i][j][0]=dp[i][j-1][0]+(a[j]==2)
dp[i][j][1]=max(dp[i][j-1][0],dp[i][j-1][1])+(a[j]==1)

#include<bits/stdc++.h>
using namespace std;
const int N = 2005;
int dp[N][N][2];
int arr[N],pre[N],suf[N];
int main(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>arr[i];
		pre[i]=pre[i-1]+(arr[i]==1);
	}
	for(int i=n;i>0;i--) 
	   suf[i]=suf[i+1]+(arr[i]==2);
	
	int ans=0;
	for(int i=1;i<=n;i++){
		for(int j=i;j<=n;j++){
			dp[i][j][0]=dp[i][j-1][0]+(arr[j]==2);
			dp[i][j][1]=max(dp[i][j-1][0],dp[i][j-1][1])+(arr[j]==1);
			ans=max(ans,pre[i-1]+suf[j+1]+dp[i][j][0]);
			ans=max(ans,pre[i-1]+suf[j+1]+dp[i][j][1]);
		}
	}
	cout<<ans<<endl;
	return 0;
}