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;
inline long long gcd(long long a, long long b) {
  while (b != 0) {
    long long c = a % b;
    a = b;
    b = c;
  }
  return a < 0 ? -a : a;
}
inline long long lowbit(long long x) { return x & (-x); }
int head[1000010], Edge_Num;
struct Edge {
  int to, next;
  long long w;
} e[2000010];
inline void ade(int x, int y, long long w) {
  e[++Edge_Num] = {y, head[x], w};
  head[x] = Edge_Num;
}
inline void G_init(int n) {
  memset(head, 0, sizeof(int) * (n + 100));
  Edge_Num = 0;
}
int dir[8][2] = {{-1, 0},  {0, -1}, {1, 0},  {0, 1},
                 {-1, -1}, {-1, 1}, {1, -1}, {1, 1}};
const long double PI = 3.14159265358979323846;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
inline long long rd() {
  long long x = 0;
  bool f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = 0;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 3) + (x << 1) + (ch ^ 48);
    ch = getchar();
  }
  return f ? x : -x;
}
const double eps = 1e-8;
const long long mod = 1e9 + 7;
const int M = 5e6 + 10;
const int N = 5e5 + 10;
pair<int, int> a[N];
int n;
int Minx, Miny, Maxx, Maxy;
int get(int i, int x, int y) {
  int rx = x - a[i].first, ry = y - a[i].second;
  if ((long long)rx * ry > 0) return max(abs(rx), abs(ry));
  return abs(rx) + abs(ry);
}
char s[N];
map<pair<int, int>, int> mp;
int f(int x, int y) {
  if (mp.count({x, y})) return mp[{x, y}];
  int maxx = 0;
  for (int i = 1; i <= n; i++) {
    maxx = max(maxx, get(i, x, y));
  }
  return mp[{x, y}] = maxx;
}
int ansff[N];
int ff(int x) {
  if (~ansff[x]) return ansff[x];
  int l = Miny, r = Maxy;
  int ans = l;
  while (l < r) {
    int lmid = l + (r - l) / 3, rmid = r - (r - l) / 3;
    if (f(x, lmid) > f(x, rmid)) {
      ans = rmid;
      l = lmid + 1;
    } else {
      ans = lmid;
      r = rmid - 1;
    }
  }
  int mi = max(ans - 2, 0), ma = ans + 2;
  for (int i = mi; i <= ma; i++) {
    if (f(x, i) < f(x, ans)) ans = i;
  }
  return ansff[x] = ans;
}
void solve() {
  memset(ansff, -1, sizeof ansff);
  n = rd();
  for (int i = 1; i <= n; i++) {
    scanf("%s", s + 1);
    for (int j = 1; s[j]; j++) {
      if (s[j] == 'B')
        ++a[i].first;
      else
        ++a[i].second;
    }
    Minx = min(Minx, a[i].first);
    Miny = min(Miny, a[i].second);
    Maxx = max(Maxx, a[i].first);
    Maxy = max(Maxy, a[i].second);
  }
  int l = Minx, r = Maxx;
  int ansx = 0, ansy = 0;
  while (l < r) {
    int lmid = l + (r - l) / 3, rmid = r - (r - l) / 3;
    int ly = ff(lmid), ry = ff(rmid);
    if (f(lmid, ly) > f(rmid, ry)) {
      ansx = rmid;
      ansy = ly;
      l = lmid + 1;
    } else {
      ansx = lmid;
      ansy = ry;
      r = rmid - 1;
    }
  }
  int mi = max(0, ansx - 2), ma = ansx + 2;
  for (int i = mi; i <= ma; i++) {
    int y = ff(i);
    if (f(i, y) <= f(ansx, ansy)) {
      ansx = i, ansy = y;
    }
  }
  cout << f(ansx, ansy) << endl;
  cout << string(ansx, 'B') << string(ansy, 'N') << endl;
}
int main() {
  int _T = 1;
  while (_T--) solve();
}
