Lower

There are N squares arranged in a row from left to right.

The height of the i-th square from the left is H_i.

You will land on a square of your choice, then repeat moving to the adjacent square on the right as long as the height of the next square is not greater than that of the current square.

Find the maximum number of times you can move.

Constraints

• All values in input are integers.
• 1 \leq N \leq 10^5
• 1 \leq H_i \leq 10^9

Input

Input is given from Standard Input in the following format:

N H_1 H_2 ... H_N

Output

Print the maximum number of times you can move.

Examples

Input

5 10 4 8 7 3

Output

2

Input

7 4 4 5 6 6 5 5

Output

3

Input

4 1 2 3 4

Output

0

inputFormat

input are integers.

• 1 \leq N \leq 10^5
• 1 \leq H_i \leq 10^9

Input

Input is given from Standard Input in the following format:

N H_1 H_2 ... H_N

outputFormat

Output

Print the maximum number of times you can move.

Examples

Input

5 10 4 8 7 3

Output

2

Input

7 4 4 5 6 6 5 5

Output

3

Input

4 1 2 3 4

Output

0

样例

5
10 4 8 7 3

2