CF599C.Day at the Beach

One day Squidward, Spongebob and Patrick decided to go to the beach. Unfortunately, the weather was bad, so the friends were unable to ride waves. However, they decided to spent their time building sand castles.

At the end of the day there were $n$ castles built by friends. Castles are numbered from $1$ to $n$ , and the height of the $i$ -th castle is equal to $h_{i}$ . When friends were about to leave, Squidward noticed, that castles are not ordered by their height, and this looks ugly. Now friends are going to reorder the castles in a way to obtain that condition $h_{i}<=h_{i+1}$ holds for all $i$ from $1$ to $n-1$ .

Squidward suggested the following process of sorting castles:

• Castles are split into blocks — groups of consecutive castles. Therefore the block from $i$ to $j$ will include castles $i,i+1,...,j$ . A block may consist of a single castle.
• The partitioning is chosen in such a way that every castle is a part of exactly one block.
• Each block is sorted independently from other blocks, that is the sequence $h_{i},h_{i+1},...,h_{j}$ becomes sorted.
• The partitioning should satisfy the condition that after each block is sorted, the sequence $h_{i}$ becomes sorted too. This may always be achieved by saying that the whole sequence is a single block.

Even Patrick understands that increasing the number of blocks in partitioning will ease the sorting process. Now friends ask you to count the maximum possible number of blocks in a partitioning that satisfies all the above requirements.

The first line of the input contains a single integer $n$ ( $1<=n<=100000$ ) — the number of castles Spongebob, Patrick and Squidward made from sand during the day.

The next line contains $n$ integers $h_{i}$ ( $1<=h_{i}<=10^{9}$ ). The $i$ -th of these integers corresponds to the height of the $i$ -th castle.

Print the maximum possible number of blocks in a valid partitioning.

In the first sample the partitioning looks like that: [1][2][3].

In the second sample the partitioning is: [2, 1][3, 2]