Longest Matching Substring :
Difficulty Level : Medium
Submissions : 50
Asked In :
Marks :10
: 1 | : 0
Given a string of 0's and 1's. Find the longest substring which has equal number of 0's and 1's. If there are multiple such substrings with the same length, then output the substring which occurs first.
Input
The first line contains and integer n which denotes the size of the string. The next line contains a n length string of 0's and 1's
Output
A single string which corresponds to the longest substring with equal number of 0s and 1s.
Example
Input
11 11101011100
Output
01011100
