Maximum Zeros

You have a binary string (a string contains only ones and zeros) Define: - F(s)=Z(s)-O(s) - Z(s)=number of zeros in s - O(s)=number of ones in s You want to find l and r such that F(s[l:r]) maximum possible and s[l:r] is its substring starting from l to r Input The first line conatins integer N which is the string size Then a string of size N contains only zeros and ones Outoput The firs