#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cassert>
#include <cstdint>
#include <numeric>
#include <bitset>
#include <functional>

using namespace std;

using ll =  long long;
using Pll = pair<ll, ll>;
using Pii = pair<int, int>;

constexpr ll MOD = 1000000007;
constexpr long double EPS = 1e-10;
constexpr int dyx[4][2] = {
    { 0, 1}, {-1, 0}, {0,-1}, {1, 0}
};

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int n;
    cin >> n;
    int a[n+1];
    a[0] = 0;
    for(int i=1;i<=n;++i){
        cin >> a[i];
    }

    int dp[n+1][2];
    fill_n(dp[0], (n+1)*2, 0);
    for(int i=1;i<=n;++i) {
        dp[i][0] = max(dp[i-1][0], dp[i-1][1]);
        if(a[i-1] < a[i]) {
            dp[i][1] = max(dp[i-1][0]+1, dp[i-1][1]);
        } else if(a[i-1] == a[i]) {
            dp[i][1] = max(dp[i-1][0], dp[i-1][1]) + 1;
        } else {
            dp[i][1] = dp[i-1][0] + 1;
        }
    }

    cout << max(dp[n][0], dp[n][1]) << endl;
}