#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <cmath>

#include <algorithm>

#include <assert.h>

#define IOS ios::sync_with_stdio(false)

using namespace std;

#define inf (0x3f3f3f3f)

typedef long long int LL;

#include <iostream>

#include <sstream>

#include <vector>

#include <set>

#include <map>

#include <queue>

#include <string>

#include <bitset>

const int maxn = 1e4 + ;

int c[maxn];

int lowbit(int x) {

    return x & (-x);

}

void upDate(int pos, int val) {

    while (pos <= maxn - ) {

        c[pos] = max(c[pos], val);

        pos += lowbit(pos);

    }

}

int ask(int pos) {

    int ans = ;

    while (pos) {

        ans = max(ans, c[pos]);

        pos -= lowbit(pos);

    }

    return ans;

}

int a[maxn];

int n;

int last[maxn], pre[maxn];

void work() {

    memset(c, , sizeof c);

    for (int i = ; i <= n; ++i) cin >> a[i];

    last[n] = ;

    for (int i = n - ; i >= ; --i) {

        if (a[i] < a[i + ]) {

            last[i] = last[i + ] + ;

        } else last[i] = ;

    }

    pre[] = ;

    for (int i = ; i <= n; ++i) {

        if (a[i] > a[i - ]) {

            pre[i] = pre[i - ] + ;

        } else pre[i] = ;

    }

    int ans = ;

    for (int i = ; i <= n; ++i) {

        ans = max(ans, last[i] + ask(a[i] - ));

        upDate(a[i], pre[i]);

    }

    cout << ans << endl;

}

int main() {

#ifdef local

    freopen("data.txt", "r", stdin);

//    freopen("data.txt", "w", stdout);

#endif

    IOS;

    while (cin >> n) work();

    return ;

}