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;
int64_t mod = 1e9 + 7;
int64_t mod1 = 1e9 + 5;
int64_t power(int64_t a, int64_t b) {
  if (b == 0)
    return 1;
  else if (b % 2 == 0)
    return power(((((a) % mod) * ((a) % mod)) % mod), b / 2) % mod;
  else
    return (((a) % mod) *
            (power(((((a) % mod) * ((a) % mod)) % mod), b / 2) % mod)) %
           mod;
}
inline int64_t inverse(int64_t a, int64_t md) {
  a %= md;
  if (a < 0) a += md;
  int64_t b = md, u = 0, v = 1;
  while (a) {
    int64_t t = b / a;
    b -= t * a;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  assert(b == 1);
  if (u < 0) u += md;
  return u;
}
const int ce = 1e9 + 7;
int64_t fast_mod(int64_t input) { return input < ce ? input : input % ce; }
vector<int> v[2000001], v1[2000001];
int cntb[2000001], cntc[2000001];
int ri[2000001], le[2000001];
int n;
int maxi;
int c1 = 0;
int th = 1000000;
int freq[2000001];
multiset<int> s, s1;
int check(int mid) {
  s.clear(), s1.clear();
  maxi = 0;
  for (int i = 0; i < n; i++) {
    if (cntb[i] <= mid) {
      maxi = max(maxi, cntc[i] + mid - cntb[i]);
    } else {
      maxi = max(maxi, cntc[i]);
    }
  }
  assert(maxi <= 1e6);
  for (int i = 0; i <= maxi; i++) v[i].clear(), v1[i].clear();
  int cost = 0;
  vector<int> v2, v3;
  for (int i = 0; i < n; i++) {
    if (cntb[i] <= mid) {
      cost = max(cost, mid - cntb[i]);
      v2.push_back(mid - cntb[i] + cntc[i]);
      v3.push_back(mid - cntb[i] - (cntc[i] + mid - cntb[i]));
      v[cntc[i]].push_back(mid - cntb[i] + cntc[i]);
      v1[cntc[i] + mid - cntb[i]].push_back(mid - cntb[i] -
                                            (cntc[i] + mid - cntb[i]));
    }
    if (cntb[i] > mid) {
      cost = max(cost, cntb[i] - mid);
      v2.push_back(cntb[i] - mid + max(cntc[i] - (cntb[i] - mid), 0));
      v3.push_back(cntb[i] - mid - (cntc[i]));
      v[max(cntc[i] - (cntb[i] - mid), 0)].push_back(
          cntb[i] - mid + max(cntc[i] - (cntb[i] - mid), 0));
      v1[cntc[i]].push_back(cntb[i] - mid - (cntc[i]));
    }
  }
  sort(v2.begin(), v2.end());
  sort(v3.begin(), v3.end());
  for (int i = 0; i <= maxi; i++) le[i] = 0, ri[i] = 0;
  for (int i = 0; i <= maxi; i++) {
    for (auto j : v[i]) {
      freq[j + th]++;
    }
    while (v2.size() and freq[v2.back() + th]) {
      freq[v2.back() + th]--;
      v2.pop_back();
    }
    if (v2.size() == 0) break;
    ri[i] = v2.back() - i;
  }
  for (int i = maxi; i >= 0; i--) {
    for (auto j : v1[i]) {
      freq[j + th]++;
    }
    while (v3.size() and freq[v3.back() + th]) {
      freq[v3.back() + th]--;
      v3.pop_back();
    }
    if (v3.size() == 0) break;
    le[i] = v3.back() + i;
  }
  int cost1 = 1e9;
  for (int i = 0; i <= maxi; i++) {
    cost1 = min(cost1, max(le[i], ri[i]));
    if (cost1 >= max(le[i], ri[i])) c1 = i;
  }
  assert(cost1 != 1e9);
  return max(cost1, cost);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n;
  maxi = 0;
  int s1 = 0;
  memset(freq, 0, sizeof(freq));
  for (int i = 0; i < n; i++) {
    string s;
    cin >> s;
    int c = 0, c1 = 0;
    maxi = max(maxi, (int)s.length());
    for (int j = 0; j < s.length(); j++) {
      if (s[j] == 'B')
        c++;
      else
        c1++;
    }
    cntb[i] = c, cntc[i] = c1;
    s1 = max(s1, cntb[i]);
  }
  int l = -1, r = s1 + 1;
  while (r - l > 4) {
    int lm = (l * 2 + r) / 3;
    int rm = (r * 2 + l) / 3;
    if (check(lm) > check(rm)) {
      l = lm;
    } else {
      r = rm;
    }
  }
  int ans = 1e9, in, fill;
  for (int i = l + 1; i < r; i++) {
    if (check(i) <= ans) {
      ans = check(i);
      in = i;
      fill = c1;
    }
  }
  cout << ans << '\n';
  for (int i = 1; i <= in; i++) cout << "B";
  for (int i = 1; i <= fill; i++) cout << "N";
  cout << '\n';
}
