Deep in the fen lights of Will-o-Wisp, Dev studies rows of scrolls entries. One clean number will settle the guild's oldest argument. 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 <= 3737; 1 <= a[i] <= 1000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 3737; 1 <= a[i] <= 1000000.
