Decryption

It is known that if you keep the first and last letters of each word in a text and rearrange the remaining letters arbitrarily, the resulting text can still be read fairly easily. A computer science laboratory studies an analogous phenomenon for number sequences.

A sequence of positive integers is called correct if its first number is the minimum and its last number is the maximum. For example, the sequences $[1, 3, 2, 4]$ and $[1, 2, 1, 2]$ are correct, while the sequence $[1, 3, 2]$ is not.

A sequence $[a_1, a_2, \ldots, a_n]$ is given. A segment of consecutive elements $[a_l, a_{l+1}, \ldots, a_r]$ of the given sequence is called correct if it forms a correct sequence: $a_l$ is the minimum on this segment and $a_r$ is the maximum.

As part of the study, the given sequence must be split into the minimum number of non-overlapping correct segments. For example, the sequence $[2, 3, 1, 1, 5, 1]$ can be split into three correct segments: $[2, 3]$, $[1, 1, 5]$, and $[1]$.

Write a program that, given a sequence, determines the minimum number of correct segments it can be split into.

The first line contains the integer $n$, the number of elements in the given sequence ($1 \le n \le 300\,000$).

The second line contains $n$ integers $a_1, a_2, \ldots, a_n$, the given sequence ($1 \le a_i \le 10^9$).

Print a single number: the minimum number of correct segments into which the given sequence can be split.