#include <iostream>
#include <deque>
#include <vector>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<int> pearls;
    pearls.resize(n);
    deque<int> maxs;
    for (int i = 0; i < n; ++i) {
        cin >> pearls[i];
        if (maxs.empty() || maxs.back() < pearls[i]) {
            maxs.push_back(pearls[i]);
        }
    }
    int res = ssize(maxs);
    for (int i = n - 1; i > 0; --i) {
        while (!maxs.empty() && maxs.front() <= pearls[i]) {
            maxs.pop_front();
        }
        maxs.push_front(pearls[i]);
        if (res < ssize(maxs)) {
            res = ssize(maxs);
        }
    }
    cout << res << "\n";
}