Waved Subarray

题号：NC237179
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld

题目描述

You are given a array of $N(1\leq N\leq 10^5)$ integers. For a pair $(l,r),l<=r$ , we consider it's valid if the subarray between $l$ and $r$ is waved .The array is waved if and only if $v_l>v_{l+1}<v_{l+2}>\dots v_r$ or $v_i<v_{i+1}>v_{i+2}<\dots v_r$ .
Fop_zz wants to know the length of the longest waved subarray. Formally, you should tell him the maximum value of $(r-l+1)$ for all valid pairs $(l,r)$ .
It is guaranteed that $vi$ is between $1$ and $10^6$ .

输入描述:

The first line contains the length of the array .
The second line contains  integers represent the elements of the array

输出描述:

Output a single integer representing the length of the longest waved subarray.

示例1

输入

复制

5
1 3 1 1 4

输出

复制