时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 32 M，其他语言64 M
64bit IO Format: %lld
空间限制：C/C++/Rust/Pascal 32 M，其他语言64 M
64bit IO Format: %lld
题目描述
To play against the threats of malicious countries nearby, Country R has updated their missile defence system. The new type system can bring down a series of missiles as long as they are coming in ascending order by altitude or descending order by altitude.
Given the heights of a sequence of coming missiles, the general wants to know how many sets of the new type systems are needed to bring down all of them.
输入描述:
The input consists of several test cases. The first line of each test case contains an integer n. The next line contains n different integers indicating the heights.
输出描述:
For each test case output a single line containing the number of systems needed.
备注:
Two sets of systems are needed for the sample. One brings down 3, 4 and the other brings down 5, 2, 1.