// Arup Guha
// 11/5/2016
// Solution to SER 2016 Division II Problem K: ZigZag (also in D1)

import java.util.*;
import java.io.*;

public class zigzag {

	public static void main(String[] args) throws Exception {

		// Read in everything.
		BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
		int n = Integer.parseInt(stdin.readLine().trim());
		int[] vals = new int[n];
		for (int i=0; i<n; i++)
			vals[i] = Integer.parseInt(stdin.readLine().trim());

		// Solve it.
		System.out.println(solve(vals));
	}

	public static int solve(int[] vals) {

		// Simple case.
		if (vals.length == 1) return 1;

		// Skip equal values.
		int res = 1;
		int i = 0;
		while (i < vals.length && vals[i] == vals[0]) i++;

		if (i == vals.length) return 1;

		// Set up direction.
		boolean dir = vals[i] > vals[0];
		res++;
		int cur = vals[i];
		i++;
		
		// Scan till end.
		while (i<vals.length) {

			// Turn back down.
			if (dir && vals[i]<cur) {
				res++;
				dir = !dir;
			}
			
			// Turn back up.
			else if (!dir && vals[i]>cur) {
				res++;
				dir = !dir;
			}
			
			// Update cur.
			cur = vals[i];
			i++;

		}

		return res;
	}
}