A. Kefa and First Steps

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.

Sample test(s)

Input

62 2 1 3 4 1

Output

3

Input

32 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.

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<algorithm>
 4 using namespace std;
 5 int main()
 6 {
 7     int a[100005];
 8     int n;
 9     scanf("%d",&n);
10     for(int i=0;i<n;i++)
11         scanf("%d",&a[i]);
12     int ans=0,maxn=1;
13     for(int i=1;i<n;i++)
14         if(a[i]>=a[i-1])maxn++;
15         else ans=max(maxn,ans),maxn=1;
16     ans=max(maxn,ans);
17     printf("%d\n",ans);
18     return 0;
19 }