A - Kefa and First Steps

Problem description

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_i money. Kefa loves progress, that's why he wants to know the length of the maximum non-decreasing subsegment in sequence a_i. 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!

Input

The first line contains integer n (1 ≤ n ≤ 10⁵).

The second line contains n integers a₁,  a₂,  ...,  a_n (1 ≤ a_i ≤ 10⁹).

Output

Print a single integer — the length of the maximum non-decreasing subsegment of sequence a.

Examples

Input

6
2 2 1 3 4 1

Output

3

Input

3
2 2 9

Output

3

Note

In the first test the maximum non-decreasing subsegment is the numbers from the third to the fifth one.

In the second test the maximum non-decreasing subsegment is the numbers from the first to the third one.

解题思路：求最大非递减序列的长度，注意maxlen初始值为1，水过！

AC代码：

 #include<bits/stdc++.h>
 using namespace std;
 int n,len=,maxlen=,a[];
 int main(){
     cin>>n;
     for(int i=;i<n;++i)cin>>a[i];
     for(int i=;i<n;++i){
         if(a[i]>=a[i-])len++;
         else len=;
         maxlen=max(maxlen,len);
     }
     cout<<maxlen<<endl;
     return ;
 }