B'You are given a string s consisting of n lowercase Latin letters. Some indices in this string are marked as forbidden. You want to find a string a such that the value of |a| xc2 xb7f(a) is maximum possible, where f(a) is the number of occurences of a in s such that these occurences end in non-forbidden indices. So, for example, if s is aaaa, a is aa and index 3 is forbidden, then f(a) xe2 x80 x89= xe2 x80 x892 because there are three occurences of a in s (starting in indices 1, 2 and 3), but one of them (starting in index 2) ends in a forbidden index. Calculate the maximum possible value of |a| xc2 xb7f(a) you can get. The first line contains an integer number n (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89200000) -- the length of s. The second line contains a string s, consisting of n lowercase Latin letters. The third line contains a string t, consisting of n characters 0 and 1. If i-th character in t is 1, then i is a forbidden index (otherwise i is not forbidden). Print the maximum possible value of |a| xc2 xb7f(a). '...