The council of the tannery row of Leatherwick pays by the answer, and Warden intends to earn it. First: the full register of ribbons. 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 <= 1104; 0 <= a[i] <= 1000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 1104; 0 <= a[i] <= 1000000.
