Kefa and First Steps

Source: Codeforces

Version: Phuoc Hung OJ Extended

Problem

Given $a_1,\ldots,a_n$, find the maximum length of a contiguous segment $a_l,\ldots,a_r$ satisfying $a_i\le a_{i+1}$ for every $l\le i<r$.

Input

Line 1 contains $n$. Line 2 contains $a_1,\ldots,a_n$.

Output

Print the required integer answer.

Subtasks

Subtask 1 (20 points): $1\le n\le 50$; $1\le a_i\le 1000$.

Subtask 2 (30 points): $1\le n\le 5000$; $1\le a_i\le 1000000$.

Subtask 3 (50 points): $1\le n\le 100000$; $1\le a_i\le 1000000000$.

Example

Input

6
2 2 1 3 4 1

Output

3

Explanation

The values follow directly from the definitions and illustrate the valid index range of the array scan.