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 <stdio.h>
#include <stdlib.h>

int main()
{
    int count;
    int max = 1;
    int result = 1;
    scanf("%d", &count);

    int *numbers = (int *)malloc(count * sizeof(int));

    for (int i = 0; i < count; i++)
    {
        scanf("%d", &numbers[i]);
    }

    for(int i = 0; i < count; i++)
    {
        if(i == count - 1)
        {
            max++;
            break;
        }
        if(numbers[i] <= numbers[i+1])
        {
            max++;
            if(max >= result)
            {
                result = max;
            }
        }
        else{
            max = 1;
        }
    }

    printf("%d\n", result);


    return 0;
}
