codeforces 580A Kefa and First Steps

A. Kefa and First Steps

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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

Examples

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.

AC:

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    long long a[100010];
    scanf("%d",&n);
    int maxx=1,sum=1;
    for(int i=0;i<n;i++)
        cin>>a[i];
    for(int i=1;i<n;i++)
    {
        if(a[i]>=a[i-1])
        {
            sum++;
            maxx=max(maxx,sum);
        }
        else
        {
            maxx=max(maxx,sum);
            sum=1;
        }
    }
    printf("%d",maxx);
}