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 <iostream>
#include <vector>
 
using namespace std;
 
int maxmm(vector <int> t)
{
    int i = 0;
    int max = t[0];
    while (i<t.size())
    {
        if(max<t[i])
            max=t[i];
        i++;
    }
    return max;
}
 
int main()
{
    int n;
    int sum =0;
    vector <int> t;
    vector <int> t2;
    cin>>n;
    while (n--)
    {
        int d;
        cin>>d;
        t.push_back(d);
    }
    int j = 0;
    int i = 0;
    while (i < t.size())
    {
        while(i < t.size() && t[i] <= t[i+1] && t[i+1])
        {
            i++;
            j++;
        }
        t2.push_back(j);
        j = 0;
        i++;
    }
    cout<<maxmm(t2) + 1<<endl;
}