The log keeper Jarl has been asked to fulfill a tricky customer order. On the desk lies a long table of panels readings. 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 <= 1313; -1000000 <= a[i] <= 1000000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 1313; -1000000 <= a[i] <= 1000000000.
