Every season at the cotton rows of Whitewick, someone must plan the beacon maintenance rota. This year the task falls to Dino, armed only with the segments register. Task: Print the length of the longest contiguous run in which elements alternate even, odd, even, odd, ... Input format: First line: n. Second line: n integers. Output format: Print the maximum parity-alternating run length. Constraints: 1 <= n <= 1996; -1000000 <= a[i] <= 1000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 1996; -1000000 <= a[i] <= 1000000.
