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!

Input

The first line contains integer $*n*$ ($1 ≤ *n* ≤ 10^{5}$).

The second line contains $*n*$ integers $*a*_{1},  *a*_{2},  ...,  *a*_{*n*}$ ($1 ≤ *a*_{*i*} ≤ 10^{9}$).

Output

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

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.