#include <set>
#include <vector>
#include <iostream>
#include <algorithm>
#include <iterator>

int main() {
    int n;
    std::cin >> n;
    std::vector<int> pearls(n);
    for (int i = 0; i < n; i++) {
        std::cin >> pearls[i];
    }

    auto it = std::max_element(pearls.begin(), pearls.end());
    int idx = it - pearls.begin();
    std::rotate(pearls.begin(), pearls.begin() + idx, pearls.end());

    std::set<std::pair<int,int>> active;
    active.insert({pearls[0], 1});
    int result = 1;
    for (int i = n - 1; i > 0; i--) {
        auto it = active.upper_bound({pearls[i], 0});
        if (it->first == pearls[i]) {
            active.erase(it);
            it = active.upper_bound({pearls[i], 0});
        }
        if (it == active.end()) {
            active.insert({pearls[i], 1});
        } else {
            result = std::max(result, (*it).second + 1);
            active.insert({pearls[i], (*it).second + 1});
        }
        while (!active.empty()) {
            auto it = active.begin();
            if ((*it).first < pearls[i]) {
                active.erase(active.begin());
            } else {
                break;
            }
        }
    }
    std::cout << result << std::endl;
    return 0;
}