• محدودیت زمان: ۲ ثانیه
• محدودیت حافظه: ۱۲۸ مگابایت

There are N balloons floating in the air in a large room, lined up from left to right. Young Parva likes to play with arrows and practice her hunting abilities. She shoots an arrow from the left to the right side of the room from an arbitrary height she chooses.

The arrow moves from left to right, at a chosen height $h$ until it finds a balloon. The moment when an arrow touches a balloon, the balloon pops and disappears and the arrow continues its way from left to right at a height decreased by 1. Therefore, if the arrow was moving at height $h$, after popping the balloon it travels on height $h-1$.

Our hero’s goal is to pop all the balloons using as little arrows as possible.

Input

The first line of input contains the integer N.

The second line of input contains an array of N integers $h_i$

Each integer $h_i$ is the height at which the i-th balloon floats, respectively from left to right.

Output

The first and only line of output must contain the minimal number of times Parva needs to shoot an arrow so that all balloons are popped.

Constraints

• $1 \leq N,h_i \leq 10^6$

Sample Test Data

input 1

5
2 1 5 4 3

output 1

2

input 2

5
4 5 2 1 4

output 2

3