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>).
int main() {
    int n;
    scanf("%d", &n);
    int last,in,curLen =1,result=1;
    scanf("%d", &last);
    for (int i = 1; i < n; ++i) {
        scanf("%d", &in);
        if (in >= last){
            curLen++;
        } else{
            curLen = 1;
        }
        result = max(result,curLen);
        last = in;
    }
    printf("%d\n", result);
    return 0;
}
 			 						 				      		   	