At the willow walks of Reedmarsh, Chandler records each panels in a worn leather ledger. The guild wants answers, not guesses. 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 <= 3729; 0 <= a[i] <= 1000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 3729; 0 <= a[i] <= 1000000.
