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

int widestValley(vector<int> measurements) {
    int max_width = -1;
    int valley_start = -1;
    for (int i = 0; i < measurements.size() - 2; i++) {
        // Check if we have a valley starting at i
        if (measurements[i] > measurements[i + 1] && measurements[i + 1] < measurements[i + 2]) {
            valley_start = i;
            // Find the end of the valley
            for (int j = i + 2; j < measurements.size(); j++) {
                if (measurements[j] >= measurements[j - 1]) {
                    int valley_width = j - valley_start - 1;
                    if (valley_width > max_width) {
                        max_width = valley_width;
                    }
                    break;
                }
            }
        }
    }
    return max_width;
}

int main() {
    int n;
    cin >> n;
    vector<int> measurements(n);
    for (int i = 0; i < n; i++) {
        cin >> measurements[i];
    }
    int max_width = widestValley(measurements);
    cout << max_width << endl;
    return 0;
}