Longest Balanced Binary Subarray

MediumArrayPrefix-SumHashing5 hidden tests

Given a binary array, find the length of the longest contiguous subarray that contains an equal number of 0s and 1s.

Input format

Line 1: an integer n. Line 2: n space-separated integers, each 0 or 1 (present whenever n >= 1).

One line: the length of the longest balanced subarray (0 if none exists).

Example 1

Input

6
0 1 0 0 1 1

Expected

Explanation

The whole array has three 0s and three 1s, so the longest balanced subarray has length 6.

Example 2

Input

3
1 1 1

Expected

Explanation

No subarray has equal 0s and 1s, so the answer is 0.

Ready to solve this?

Sign in to open the editor, run your code against the sample tests, and submit against the full test suite.