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;
using ll = long long;
const int L = 5 * (int)1e5;
pair<int, int> solve(const vector<pair<int, int>>& pairs, int k) {
  int x_min = 0, x_max = L;
  int y_min = 0, y_max = L;
  int d_min = -L, d_max = L;
  for (auto pr : pairs) {
    int x = pr.first;
    int y = pr.second;
    x_min = max(x_min, x - k);
    x_max = min(x_max, x + k);
    y_min = max(y_min, y - k);
    y_max = min(y_max, y + k);
    d_min = max(d_min, x - y - k);
    d_max = min(d_max, x - y + k);
  }
  int dx = x_max - x_min;
  int dy = y_max - y_min;
  if (dx < 0 || dy < 0 || d_min > d_max) return {-1, -1};
  int tar_d = x_max - y_max;
  int it_a = max(d_min, tar_d - dx);
  int it_b = min(d_max, tar_d + dy);
  if (it_a > it_b)
    return {-1, -1};
  else if (it_a < tar_d)
    return {x_max - (tar_d - it_a), y_max};
  else
    return {x_max, y_max - (it_a - tar_d)};
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<pair<int, int>> pairs(n);
  for (int i = 0; i < n; ++i) {
    string str;
    cin >> str;
    int c0 = 0;
    for (auto c : str) c0 += (c == 'B');
    pairs[i] = {c0, (int)str.size() - c0};
  }
  int low = 0;
  int high = L;
  while (low != high) {
    int mid = (low + high) >> 1;
    if (solve(pairs, mid).first == -1)
      low = mid + 1;
    else
      high = mid;
  }
  auto pr = solve(pairs, low);
  int m = pr.first + pr.second;
  string res(m, 'B');
  for (int i = pr.first; i < m; ++i) res[i] = 'N';
  cout << low << '\n';
  cout << res << '\n';
}
