#include<bits/stdc++.h> using namespace std; int w(vector<int>& nums) { if (nums.size() < 2) return nums.size(); int u = 1; int d = 1; for (int i = 1; i < nums.size(); ++i) { if (nums[i] > nums[i - 1]) { u = d + 1; } else if (nums[i] < nums[i - 1]) { d = u + 1; } } return max(u, d); } int main() { int n; cin >> n; vector<int> nums(n); for (int i = 0; i < n;i++) { cin >> nums[i]; } cout << w(nums) << endl; return 0; }