#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
template <class T>
using MaxHeap = std::priority_queue<T>;
template <class T>
using MinHeap = std::priority_queue<T, vector<T>, greater<T>>;
#define rep2(i, n) for (ll i = 0; i < (n); i++)
#define rep3(i, l, r) for (ll i = (l); i < (r); i++)
#define rrep2(i, n) for (ll i = n; i-- > 0;)
#define rrep3(i, r, l) for (ll i = (r); i-- > (l);)
#define overload(a, b, c, d, ...) d
#define rep(...) overload(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define rrep(...) overload(__VA_ARGS__, rrep3, rrep2)(__VA_ARGS__)
#define all(x) begin(x), end(x)
bool chmin(auto& lhs, auto rhs) {
    return lhs > rhs ? lhs = rhs, 1 : 0;
}
bool chmax(auto& lhs, auto rhs) {
    return lhs < rhs ? lhs = rhs, 1 : 0;
}
struct IOIO {
    IOIO() {
        std::cin.tie(0)->sync_with_stdio(0);
    }
} ioio;

void solve() {
    int n;
    cin >> n;
    vector<ll> a(n);
    rep(i, n) cin >> a[i];
    const int D = 14;
    ll ans = 0;
    ll S = 0;
    rep(s, 1 << D) {
        ll t = s ^ ((1 << D) - 1);
        ll B = 0;
        ll W = 0;
        bool ok = true;
        rep(i, n) {
            if ((s & a[i]) && (t & a[i])) {
                ok = false;
                break;
            } else if (s & a[i]) {
                B |= a[i];
            } else {
                W |= a[i];
            }
        }
        if (ok) {
            if (chmax(ans, W * B)) S = s;
        }
    }
    ll s = S;
    ll t = s ^ ((1 << D) - 1);
    string color;
    rep(i, n) {
        if (s & a[i]) {
            color.push_back('B');
        } else {
            color.push_back('W');
        }
    }
    cout << ans << endl;
    cout << color << endl;
}

int main() {
    int t = 1;
    //  cin >> t;
    while (t--) solve();
}