The ledger master Mira has been asked to plan the harvest festival. On the desk lies a long table of windows readings. Task: Print the length of the longest contiguous run in which every two consecutive elements differ. Input format: First line: n. Second line: n integers. Output format: Print the maximum alternating run length. Constraints: 1 <= n <= 3878; 0 <= a[i] <= 1000000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 3878; 0 <= a[i] <= 1000000000.
