Problem: 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.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
inline void chkmin(T1& a, T2 b) {
  if (a > b) a = b;
}
template <typename T1, typename T2>
inline void chkmax(T1& a, T2 b) {
  if (a < b) a = b;
}
using ll = long long;
using ld = long double;
const string FILENAME = "input";
const int MAXN = 300228;
const ld eps = 1e-7;
struct Point {
  ld x, y;
  Point() {}
  Point(ld _x, ld _y) : x(_x), y(_y) {}
  ld len() { return sqrt(x * x + y * y); }
};
Point operator+(const Point& a, const Point& b) {
  return Point(a.x + b.x, a.y + b.y);
}
Point operator-(const Point& a, const Point& b) {
  return Point(a.x - b.x, a.y - b.y);
}
ld operator*(const Point& a, const Point& b) { return a.x * b.y - a.y * b.x; }
ld operator^(const Point& a, const Point& b) { return a.x * b.x + a.y * b.y; }
struct Line {
  ld a, b, c;
  Line() {}
  Line(ld _a, ld _b, ld _c) {
    a = _a;
    b = _b;
    c = _c;
    ld d = sqrt(a * a + b * b);
    a /= d;
    b /= d;
    c /= d;
    if (c < 0) {
      a *= -1;
      b *= -1;
      c *= -1;
    }
  }
  Line(Point s, Point f) {
    a = f.y - s.y;
    b = s.x - f.x;
    ld d = sqrt(a * a + b * b);
    a /= d;
    b /= d;
    c = -(a * s.x + b * s.y);
    if (c < 0) {
      a *= -1;
      b *= -1;
      c *= -1;
    }
  }
  ld get(const Point& p) { return a * p.x + b * p.y + c; }
};
Point getPoint(Line a) { return Point(a.a, a.b); }
Point cross(const Line& a, const Line& b) {
  ld det = a.a * b.b - b.a * a.b;
  assert(abs(det) >= eps);
  return Point((-a.c * b.b + b.c * a.b) / det,
               (-a.c * b.a + b.c * a.a) / (-det));
}
Line buildHalfPlane(Point a, Point b) {
  Point c = a + b;
  c.x /= 2;
  c.y /= 2;
  Point d = b - a;
  swap(d.x, d.y);
  d.x *= -1;
  Line kek(c, c + d);
  if (kek.get(b) < 0) {
    kek.a *= -1;
    kek.b *= -1;
    kek.c *= -1;
  }
  return kek;
}
vector<Point> build(vector<Line> lines) {
  sort((lines).begin(), (lines).end(), [](Line al, Line bl) -> bool {
    Point a = getPoint(al);
    Point b = getPoint(bl);
    if (a.y >= 0 && b.y < 0) {
      return 1;
    }
    if (a.y < 0 && b.y >= 0) {
      return 0;
    }
    if (a.y == 0 && b.y == 0) {
      return a.x > 0 && b.x < 0;
    }
    return (a * b) > 0;
  });
  vector<pair<Line, int> > st;
  for (int it = 0; it < 2; it++) {
    for (int i = 0; i < (int)(lines).size(); i++) {
      bool fl = 0;
      while (!st.empty()) {
        if ((getPoint(st.back().first) - getPoint(lines[i])).len() <= eps) {
          if (st.back().first.c <= lines[i].c) {
            fl = 1;
            break;
          } else {
            st.pop_back();
          }
        } else if ((getPoint(st.back().first) * getPoint(lines[i])) <=
                   eps / 2) {
          return {};
        } else if ((int)(st).size() >= 2 &&
                   st[(int)(st).size() - 2].first.get(
                       cross(st.back().first, lines[i])) < 0) {
          st.pop_back();
        } else {
          break;
        }
      }
      if (!fl) {
        st.push_back({lines[i], i});
      }
    }
  }
  vector<int> en;
  en.resize((int)(lines).size());
  for (auto& x : en) {
    x = -1;
  }
  vector<Point> p;
  for (int i = 0; i < (int)(st).size(); i++) {
    int x = st[i].second;
    if (en[x] == -1) {
      en[x] = i;
    } else {
      for (int j = en[x]; j < i; j++) {
        p.push_back(cross(st[j].first, st[j + 1].first));
      }
      break;
    }
  }
  return p;
}
int n;
int x[MAXN], y[MAXN];
int posx, posy;
bool check(int len) {
  int ly = 0, ry = 1e9, lx = 0, rx = 1e9;
  for (int i = 0; i < n; i++) {
    chkmax(ly, y[i] - len);
    chkmax(lx, x[i] - len);
    chkmin(ry, y[i] + len);
    chkmin(rx, x[i] + len);
  }
  if (lx > rx || ly > ry) {
    return false;
  }
  int diffmax = -1e9, diffmin = 1e9;
  int ps = -1, ps1 = -1;
  for (int i = 0; i < n; i++) {
    chkmax(diffmax, y[i] - x[i]);
    if (diffmax == y[i] - x[i]) {
      ps1 = i;
    }
    chkmin(diffmin, y[i] - x[i]);
    if (diffmin == y[i] - x[i]) {
      ps = i;
    }
  }
  ll lsx = x[ps] - len;
  ll lsy = y[ps];
  ll rsx = x[ps];
  ll rsy = y[ps] + len;
  ll ls1x = x[ps1];
  ll ls1y = y[ps1] - len;
  ll r1x = x[ps1] + len;
  ll rs1y = y[ps1];
  if (lsy - lsx < ls1y - ls1x) {
    return false;
  }
  vector<pair<ll, ll> > kek;
  kek.push_back(make_pair(lx, ly));
  kek.push_back(make_pair(lx, ry));
  kek.push_back(make_pair(rx, ly));
  kek.push_back(make_pair(rx, ry));
  ll diff = lsy - lsx;
  ll diff1 = ls1y - ls1x;
  kek.push_back(make_pair(lx, lx + diff));
  kek.push_back(make_pair(rx, rx + diff));
  kek.push_back(make_pair(ly - diff, ly));
  kek.push_back(make_pair(ry - diff, ry));
  kek.push_back(make_pair(lx, lx + diff1));
  kek.push_back(make_pair(rx, rx + diff1));
  kek.push_back(make_pair(ly - diff1, ly));
  kek.push_back(make_pair(ry - diff1, ry));
  for (auto x : kek) {
    if (x.first >= lx && x.first <= rx && x.second >= ly && x.second <= ry) {
      if (x.second - x.first <= lsy - lsx &&
          x.second - x.first >= ls1y - ls1x) {
        if (x.second > 0 || x.first > 0) {
          posx = x.first;
          posy = x.second;
          return true;
        }
      }
    }
  }
  return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  vector<pair<int, int> > k;
  for (int it = 0; it < n; it++) {
    string s;
    cin >> s;
    for (auto c : s) {
      if (c == 'B') {
        x[it]++;
      } else {
        y[it]++;
      }
    }
    k.push_back(make_pair(x[it], y[it]));
  }
  sort((k).begin(), (k).end());
  k.resize(distance(k.begin(), unique((k).begin(), (k).end())));
  n = (int)(k).size();
  for (int it = 0; it < n; it++) {
    x[it] = k[it].first;
    y[it] = k[it].second;
  }
  if (n == 1) {
    cout << 0 << '\n';
    for (int it = 0; it < x[0]; it++) {
      cout << 'B';
    }
    for (int it = 0; it < y[0]; it++) {
      cout << 'N';
    }
    cout << '\n';
    return 0;
  }
  int l = 0;
  int r = 1000000;
  while (l < r) {
    int mid = (l + r) / 2;
    if (check(mid)) {
      r = mid;
    } else {
      l = mid + 1;
    }
  }
  check(l);
  cout << l << '\n';
  for (int i = 0; i < posx; i++) {
    cout << 'B';
  }
  for (int i = 0; i < posy; i++) {
    cout << 'N';
  }
  cout << '\n';
}