Piper runs the ropewalk at the tulip beds of Bloomhaven. Today the books show a list of windows, and the numbers must be worked out before sundown. Task: Print the length of the longest contiguous run in which every two consecutive elements differ. Input format: First line: n. Second line: n integers. Output format: Print the maximum alternating run length. Constraints: 1 <= n <= 2604; 0 <= a[i] <= 1000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 2604; 0 <= a[i] <= 1000000.
