#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int main()
{
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int N;
    cin >> N;
    vector<int> A(N);
    for (int i = 0; i < N; i++)
    {
        cin >> A[i];
    }

    const int E = 12;
    const int MASK = 0b111111111111;

    ll ans = -1;
    int maxB = 0;

    for (int b = 0; b < (1 << E); b++)
    {
        int w = (~b) & MASK;

        int blackCount = 0;
        int whiteCount = 0;
        int wor = 0;
        int bor = 0;
        for (int i = 0; i < N; i++)
        {
            if ((w | A[i]) == w)
            {
                whiteCount++;
                wor |= A[i];
            }
            if ((b | A[i]) == b)
            {
                blackCount++;
                bor |= A[i];
            }
        }

        if (whiteCount + blackCount != N) continue;
        
        ll product = (ll)wor * (ll)bor;
        if (product > ans)
        {
            ans = product;
            maxB = b;
        }
    }

    cout << ans << endl;
    for (int i = 0; i < N; i++)
    {
        cout << (((maxB | A[i]) == maxB) ? "B" : "W");
    }
    cout << endl;
}