I_love_%username%

Source: Codeforces

Version: Phuoc Hung OJ Extended

Problem

Given scores $a_1,\ldots,a_n$ in chronological order. For $i\ge2$, performance $i$ is amazing if it is strictly greater than every previous score or strictly smaller than every previous score. The first performance is not counted. Count amazing performances.

Input

Line 1 contains $n$. Line 2 contains $a_1,\ldots,a_n$.

Output

Print the required integer answer.

Subtasks

Subtask 1 (20 points): $1\le n\le 20$; $0\le a_i\le 1000$.

Subtask 2 (30 points): $1\le n\le 200$; $0\le a_i\le 5000$.

Subtask 3 (50 points): $1\le n\le 1000$; $0\le a_i\le 10000$.

Example

Input

5
100 50 200 150 200

Output

2

Explanation

The values follow directly from the definitions and illustrate the valid index range of the array scan.