B"Boboniu defines BN-string as a string s of characters 'B' and 'N'. You can perform the following operations on the BN-string s : Note that a string a is a substring of a string b if a can be obtained from b by deletion of several (possibly, zero or all) characters from the beginning and several (possibly, zero or all) characters from the end. Boboniu thinks that BN-strings s and t are similar if and only if: Boboniu also defines text{dist}(s,t) , the distance between s and t , as the minimum number of operations that makes s similar to t . Now Boboniu gives you n non-empty BN-strings s_1,s_2, ldots, s_n and asks you to find a non-empty BN-string t such that the maximum distance to string s is minimized, i.e. you need to minimize max_{i=1}^n text{dist}(s_i,t) . The first line contains a single integer n ( 1 <= n <= 3 cdot 10^5 ). Each of the next n lines contains a string s_i ( 1 <= |s_i| <= 5 cdot 10^5 ). It is guaranteed that s_i only contains 'B' and 'N'. The sum of |s_i| does not exceed 5 cdot 10^5 . In the first line, print the minimum max_{i=1}^n text{dist}(s_i,t) . In the second line, print the suitable t . If there are several possible t 's, you can print any. In the first example text{dist(B,BN)}= text{dist(N,BN)}=1 , text{dist(BN,BN)}=0 . So the maximum distance is 1 . "...