#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long; using mint=modint998244353; using ld = long double; 
const ll infl = 1LL << 60;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const vector<int> dx = {1, 0, -1, 0}; const vector<int> dy = {0, 1, 0, -1};
template<typename T> using vc = vector<T>; template<typename T> using vvc = vc<vc<T>>; template<typename T> using vvvc = vc<vvc<T>>;
using vi = vc<int>;  using vvi = vvc<int>; using vl = vc<ll>; using vvl = vvc<ll>; using vvvl = vvc<vl>; using vvvvl = vvc<vvl>;
using vs = vc<string>; using vvs = vvc<string>; using P = pair<ll, ll>;
#define nrep(i,n) for (ll i = 0; i < (n); ++i)
#define nfor(i,s,n) for(ll i=s;i<n;i++)//i=s,s+1...n-1 ノーマルfor
#define vc_cout(v){ll n = v.size();nrep(i,n)cout<<v[i]<<" \n"[i+1==n];}//一次元配列を出力する
#define vv_cout(v){ll n = v.size();nrep(i,n){nrep(j,v[i].size()){cout<<v[i][j]<<' ';}cout<<endl;}}//二次元配列を出力する
template<class T> using pq = priority_queue<T, vc<T>>;//★大きい順に取り出す コスト,頂点 bfs系で使う　小さい順じゃないですABC305E
template<class T> using pq_g = priority_queue<T, vc<T>, greater<T>>;//小さい順に取り出す　ダイクストラ法で使う
#define cout(n) cout<<n<<endl;
ll N, M;

string ll2bit(ll n, ll k) {
    string s = "";
    while(n > 0) {
        s += (n % 2) + '0';
        n /= 2;
    }
    reverse(s.begin(), s.end());
    while(s.size() < k) s = '0' + s;
    return s;
}

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cin >> N;
    vl a(N);
    vc<string> s(N);
    nrep(i, N){
        cin >> a[i];
    }
    vc<pair<ll, string>> v;
    nrep(bits, 1 << 12) {
        string tmp_s = "";
        ll tmp_w = 0;
        ll tmp_b = 0;
        nrep(i, N) {
            bool w = false;
            bool b = false;
            nrep(j, 12) {
                if (a[i] & (1 << j) && bits & (1 << j)) {
                    w = true;
                } else if (a[i] & (1 << j) && !(bits & (1 << j))) {
                    b = true;
                }
            }
            if (w && b) goto skip;
            if(w) {
                tmp_s += "W";
                tmp_w |= a[i];
            } else if(b) {
                tmp_s += "B";
                tmp_b |= a[i];
            } else {
                tmp_s += "W";
            }
        }
        v.push_back({tmp_w * tmp_b, tmp_s});
        skip:;
    }
    // nrep(i, v.size()) {
    //     cout << v[i].first << " " << v[i].second << endl;
    // }
    sort(v.rbegin(), v.rend());
    cout << v[0].first << endl;
    cout << v[0].second << endl;
}