C. A Twisty Movement(LCS)

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 a1, a2, ..., an.

Little Tommy is among them. He would like to choose an interval [l, r] (1 ≤ l ≤ r ≤ n), then reverse al, al + 1, ..., ar 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 p1, p2, ..., pk, such that p1 < p2 < ... < pk and ap1 ≤ ap2 ≤ ... ≤ apk. 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 a1, a2, ..., an (1 ≤ ai ≤ 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

Copy

4
1 2 1 2

Output

Copy

4

Input

Copy

10
1 1 2 2 2 1 1 2 2 1

Output

Copy

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.

#include<bits/stdc++.h>
using namespace std;

const int maxn=2010;

#define rep(i,a,b) for(int i=a;i<b;i++)
#define per(i,a,b) for(int i=b-1;i>=a;i--)

//模版串。 要反转的话，肯定是 21，但是可能出现 11121222，所以两边都加上
//然后求他和原串的最大重复匹配长度就可以了
int bit[]={0,1,2,1,2};
int dp[maxn][5];

int val[maxn];
int main(){
    int n;
    scanf("%d",&n);
    rep(i,1,n+1)scanf("%d",&val[i]);

    rep(i,1,n+1){
        rep(j,1,4+1){
            dp[i][j]=dp[i-1][j];
            if(val[i]==bit[j])dp[i][j]++;
            if(dp[i][j-1]>dp[i][j])dp[i][j]=dp[i][j-1];
        }
    }
    printf("%d\n",dp[n][4]);
    return 0;
}