import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n + 1];

        for (int i = 1; i <= n; i ++ )
            arr[i] = sc.nextInt();

        // 使用动态规划，让f[i]代表以arr[i]为结尾的最长下降子序列的长度
        // 然后g[i]代表以arr[i]为起始的最长上升子序列的长度
        int[] f = new int[n + 1];
        int[] g = new int[n + 1];

        for (int i = 1; i <= n; i ++ ) {
            f[i] = 1;
            for (int j = 1; j < i; j ++ )
                if (arr[i] < arr[j])
                    f[i] = Math.max(f[i], f[j] + 1);
        }

        for (int i = 1; i <= n; i ++ ) {
            g[i] = 1;
            for (int j = 1; j < i; j ++ )
                if (arr[i] > arr[j])
                    g[i] = Math.max(g[i], g[j] + 1);
        }

        int ans = 0;
        for (int i = 1; i <= n; i ++ )
            if (f[i] > 1 && g[i] > 1)
                ans = Math.max(ans, f[i] + g[i] - 1);

        System.out.println(ans);
    }
}