#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


struct union_find{
    vector<int> par;
    vector<int> siz;
    
    union_find(int n) : par(n), siz(n, 1){
        for(int i=0; i<n; i++) par[i] = i;
    }
    
    int root(int x){
        if (par[x] == x) return x;
        return par[x] = root(par[x]);
    }
 
    void unite(int x, int y){
        int rx = root(x);
        int ry = root(y);
        if (rx == ry) return;
        if (siz[rx] < siz[ry]) swap(rx, ry);
        siz[rx] += siz[ry];
        par[ry] = rx;
    }
 
    bool same(int x, int y){
        int rx = root(x);
        int ry = root(y);
        return rx == ry;
    }
 
    int size(int x){
        return siz[root(x)];
    }
};


void solve(){
    int n; cin >> n;
    vector<int> a(n);
    for(int i=0; i<n; i++) cin >> a[i];

    union_find uf(n);
    for(int i=0; i<n-1; i++) for(int j=i+1; j<n; j++) if((a[i] & a[j]) != 0) uf.unite(i, j);

    vector<int> b(n, 0);
    for(int i=0; i<n; i++) b[uf.root(i)] |= a[i];

    vector<int> r, z;
    for(int i=0; i<n; i++) if(uf.root(i) == i){
        r.push_back(b[i]);
        z.pb(i);
    }

    int siz = r.size();
    int ans = 0;
    vector<bool> c(n, false);
    for(int bit=0; bit<(1<<siz); bit++){
        int x = 0, y = 0;
        for(int i=0; i<siz; i++){
            if(bit & (1 << i)){
                x |= r[i];
            } else {
                y |= r[i];
            }
        }
        
        if(ans < x*y){
            ans = x * y;
            for(int i=0; i<siz; i++){
                if(bit & (1 << i)){
                    c[z[i]] = true;
                } else {
                    c[z[i]] = false;
                }
            }
        }
    }

    cout << ans << endl;
    for(int i=0; i<n; i++){
        if(c[uf.root(i)]) cout << "W";
        else cout << "B";
    }
    cout << endl;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}