Kefa decided to make some money doing business on the Internet for exactly n days. He knows that on the i-th day (1 \le i \le n) he makes ai money. Kefa loves progress, that's why he wants to know the length of the maximum non-decreasing subsegment in sequence ai. 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 \le n \le 105).

The second line contains n integers a1,a2,...,an (1 \le ai \le 109).

Print a single integer - the length of the maximum non-decreasing subsegment of sequence 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.