Kefa decided to make some money doing business on the Internet for exactly *n* days. He knows that on the *i*-th day (1 ≤ *i* ≤ *n*) he makes *a*<sub class="lower-index">*i*</sub> money. Kefa loves progress, that's why he wants to know the length of the maximum non-decreasing subsegment in sequence *a*<sub class="lower-index">*i*</sub>. Let us remind you that the subsegment of the sequence is its continuous fragment. A subsegment of numbers is called non-decreasing if all numbers in it follow in the non-decreasing order.

Help Kefa cope with this task!
The first line contains integer *n* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>).

The second line contains *n* integers *a*<sub class="lower-index">1</sub>,  *a*<sub class="lower-index">2</sub>,  ...,  *a*<sub class="lower-index">*n*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>).
#include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;

#define YARAB_ACC ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
typedef vector<int> vi;
typedef pair<int, int> pi;
void kill_it() {

    int n=0; cin>>n;
    vi lengths;
    int c=0;
    int max=0;
    for(int i=0; i<n;i++){
        int x; cin>>x;
        if(x >= max){
            cout << "HERE" << "\n";
            max =x;
            c+=1;
            lengths.push_back(c);
        }else{
            max = x;
            lengths.push_back(c);
            c=1;

        }
    }

    cout << *max_element(lengths.begin(), lengths.end()) << "\n";
}

int main() {
    YARAB_ACC;

    // int t;
    // cin >> t;
    // while (t--) {
        kill_it();
    // }
    return 0;
}
