def find_length(string, n):
    # Transform: replace '0' with +1 and '1' with -1
    # Then find maximum subarray sum (Kadane's algorithm)
    transformed = [1 if c == '0' else -1 for c in string]
    
    max_diff = -float('inf')
    current = 0
    
    for val in transformed:
        current += val
        if current > max_diff:
            max_diff = current
        if current < 0:
            current = 0
    
    return max_diff