#include <bits/stdc++.h>

using namespace std;
#define endl '\n'
#define int long long

void solve()
{
    int n;
    cin >> n;
    vector<string> g(n + 1);
    for (int i = 1; i <= n; i++)
        g[i].resize(n + 1);
    if (n & 1)
    {
        g[1][1] = 'W';
        for (int j = 2; j < n; j += 2)
        {
            for (int k = j; k <= j + 1; k++)
            {
                if (k % 2 == 0)
                {
                    for (int p = 1; p <= k; p++)
                        g[p][k] = 'W', g[k][p] = 'W';
                }
                else
                {
                    for (int p = 1; p <= k; p++)
                        g[p][k] = 'B', g[k][p] = 'B';
                    g[k][k - 1] = g[k - 1][k] = 'W';
                }
            }
        }
    }
    else
    {
        g[1][1] = g[1][2] = 'W';
        g[2][2] = 'B';
        g[2][1] = 'W';
        for (int j = 3; j < n; j += 2)
        {
            for (int k = j; k <= j + 1; k++)
            {
                if (k % 2 == 1)
                {
                    for (int p = 1; p <= k; p++)
                        g[p][k] = 'W', g[k][p] = 'W';
                }
                else
                {
                    for (int p = 1; p <= k; p++)
                        g[p][k] = 'B', g[k][p] = 'B';
                    g[k][k - 1] = g[k - 1][k] = 'W';
                }
            }
        }
    }
    for(int i = 1;i <= n;i++) {
        for(int j = 1;j <= n;j++) cout << g[i][j];
        cout << endl;
    }
}

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

    return 0;
}