Almost Increasing Array

We call an array almost increasing if we can erase not more than one element from it so that the array becomes strictly increasing (that is, every element is striclty greater than every element before it).

You are given an array $a$ consisting of $n$ elements. You are allowed to replace any element with any integer number (and you may do so any number of times you need). What is the minimum number of replacements you must perform to make the array almost increasing?

Input

The first line contains one integer $n(2\le n\le 2\cdot 10^5)$ — the number of elements in $a$.

The second line contains $n$ integers $a_1,a_2,...,a_n(1\le a_i\le 10^9)$ — the array $a$.

Output

Print the minimum number of replaces you must perform so that $a$ is almost increasing.

Examples