CF580A.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!

基法决定在互联网上经商，恰好持续 $n$ 天。他已知第 $i$ 天（$1 \le i \le n$）的收入为 $a_i$。基法热爱进步，因此他想了解序列 $a_i$ 中最长非递减子段的长度。需要提醒的是：序列的子段指的是其连续的一段。若一个数字子段中所有数字均按非递减顺序排列，则称该子段为非递减子段。

请帮助基法完成这项任务！

The first line contains integer n (1 ≤ n ≤ 105).

The second line contains n integers _a_1,  _a_2,  ...,  a__n (1 ≤ a__i ≤ 109).

第一行包含一个整数 $n$（$1 \leq n \leq 10^5$）。

第二行包含 $n$ 个整数 $a_1,\ a_2,\ \dots,\ a_n$（$1 \leq a_i \leq 10^9$）。

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

输出一个整数——序列 $a$ 的最长非递减子段的长度。

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.

在第一个测试中，最长的非递减子段是从第三个数到第五个数。

在第二个测试中，最长的非递减子段是从第一个数到第三个数。