Boboniu defines BN-string as a string s of characters 'B' and 'N'.

You can perform the following operations on the BN-string s:

  * Remove a character of s. 
  * Remove a substring "BN" or "NB" of s. 
  * Add a character 'B' or 'N' to the end of s. 
  * Add a string "BN" or "NB" to the end of 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:

  * |s|=|t|. 
  * There exists a permutation p_1, p_2, …, p_{|s|} such that for all i (1≤ i≤ |s|), s_{p_i}=t_i. 



Boboniu also defines 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,…, 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 dist(s_i,t).

Input

The first line contains a single integer n (1≤ n≤ 3⋅ 10^5).

Each of the next n lines contains a string s_i (1≤ |s_i| ≤ 5⋅ 10^5). It is guaranteed that s_i only contains 'B' and 'N'. The sum of |s_i| does not exceed 5⋅ 10^5.

Output

In the first line, print the minimum max_{i=1}^n dist(s_i,t).

In the second line, print the suitable t.

If there are several possible t's, you can print any.

Examples

Input


3
B
N
BN


Output


1
BN


Input


10
N
BBBBBB
BNNNBBNBB
NNNNBNBNNBNNNBBN
NBNBN
NNNNNN
BNBNBNBBBBNNNNBBBBNNBBNBNBBNBBBBBBBB
NNNNBN
NBBBBBBBB
NNNNNN


Output


12
BBBBBBBBBBBBNNNNNNNNNNNN


Input


8
NNN
NNN
BBNNBBBN
NNNBNN
B
NNN
NNNNBNN
NNNNNNNNNNNNNNNBNNNNNNNBNB


Output


12
BBBBNNNNNNNNNNNN


Input


3
BNNNBNNNNBNBBNNNBBNNNNBBBBNNBBBBBBNBBBBBNBBBNNBBBNBNBBBN
BBBNBBBBNNNNNBBNBBBNNNBB
BBBBBBBBBBBBBBNBBBBBNBBBBBNBBBBNB


Output


12
BBBBBBBBBBBBBBBBBBBBBBBBBBNNNNNNNNNNNN

Note

In the first example dist(B,BN)=dist(N,BN)=1, dist(BN,BN)=0. So the maximum distance is 1.
#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false), cout.tie(0), cin.tie(0);
  int n;
  cin >> n;
  vector<int> x(n), y(n);
  for (int i = 0; i < n; ++i) {
    string t;
    cin >> t;
    for (char c : t)
      if (c == 'N')
        x[i]++;
      else
        y[i]++;
  }
  int X, Y;
  auto ok = [&](int mid) {
    int lt = x[0] - mid, rg = x[0] + mid, tp = y[0] + mid, bt = y[0] - mid,
        dl = x[0] - y[0] - mid, dr = x[0] - y[0] + mid;
    for (int i = 1; i < n; ++i) {
      lt = max(x[i] - mid, lt);
      rg = min(x[i] + mid, rg);
      bt = max(y[i] - mid, bt);
      tp = min(y[i] + mid, tp);
      dl = max(x[i] - y[i] - mid, dl);
      dr = min(x[i] - y[i] + mid, dr);
    }
    lt = max(0, lt);
    bt = max(0, bt);
    if (lt > rg || bt > tp || dl > dr) return false;
    if (lt - tp > dr || rg - bt < dl) return false;
    X = lt, Y = tp;
    int D = max(0, dl - (lt - tp));
    if (D <= rg - lt)
      X = lt + D;
    else
      X = rg, Y = tp - D + (rg - lt);
    return true;
  };
  int l = 0, r = 1000000;
  while (l < r) {
    int mid = (l + r) >> 1;
    if (ok(mid)) {
      r = mid;
    } else {
      l = mid + 1;
    }
  }
  ok(l);
  cout << l << "\n";
  cout << string(X, 'N') + string(Y, 'B') << '\n';
  return 0;
}
