Codeforces Round 109 (Div. 2)
A
I_love_%username%
Codeforces
800
原题
←B →
翻译中…

Vasya adores sport programming. He can't write programs but he loves to watch the contests' progress. Vasya even has a favorite coder and Vasya pays special attention to him.

翻译中…

One day Vasya decided to collect the results of all contests where his favorite coder participated and track the progress of his coolness. For each contest where this coder participated, he wrote out a single non-negative number — the number of points his favorite coder earned in the contest. Vasya wrote out the points for the contest in the order, in which the contests run (naturally, no two contests ran simultaneously).

翻译中…

Vasya considers a coder's performance in a contest amazing in two situations: he can break either his best or his worst performance record. First, it is amazing if during the contest the coder earns strictly more points that he earned on each past contest. Second, it is amazing if during the contest the coder earns strictly less points that he earned on each past contest. A coder's first contest isn't considered amazing. Now he wants to count the number of amazing performances the coder had throughout his whole history of participating in contests. But the list of earned points turned out long and Vasya can't code... That's why he asks you to help him.

翻译中…

Input

翻译中…

The first line contains the single integer $*n*$ ($1 ≤ *n* ≤ 1000$) — the number of contests where the coder participated.

翻译中…

The next line contains $*n*$ space-separated non-negative integer numbers — they are the points which the coder has earned. The points are given in the chronological order. All points do not exceed $10000$.

翻译中…

Output

翻译中…

Print the single number — the number of amazing performances the coder has had during his whole history of participating in the contests.

翻译中…

Note

翻译中…

In the first sample the performances number 2 and 3 are amazing.

翻译中…

In the second sample the performances number 2, 4, 9 and 10 are amazing.

翻译中…

样例

Input #1
5
100 50 200 150 200
Output #1
2
InputCopy OutputCopy
Input #2
10
4664 6496 5814 7010 5762 5736 6944 4850 3698 7242
Output #2
4
InputCopy OutputCopy
题目信息
题号
155A
时间限制
2 s
内存限制
256 MB
标签
暴力

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。