The council of the shipyard of Keelwind pays by the answer, and Quade intends to earn it. First: the full register of scrolls. 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 <= 2119; 1 <= a[i] <= 1000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 2119; 1 <= a[i] <= 1000.
