#include <cstdio>
#include <algorithm>
using namespace std;
char table[12][12];
int blues, reds;
pair<int, int> blue[121], red[121];
bool proc(pair<int, int>* tbl, int N, char c)
{
        for (int i = 0; i < N; ++i)
        {
                for (int j = i + 1; j < N; ++j)
                {
                        int dx = tbl[j].first - tbl[i].first;
                        int dy = tbl[j].second - tbl[i].second;
                        int x3 = tbl[i].first - dy;
                        int y3 = tbl[i].second + dx;
                        int x4 = x3 + dx;
                        int y4 = y3 + dy;
                        if (x3 < 0 || x3 >= 11 || y3 < 0 || y3 >= 11) continue;
                        if (x4 < 0 || x4 >= 11 || y4 < 0 || y4 >= 11) continue;
                        if (table[x3][y3] == c && table[x4][y4] == c) return true;
                }
        }
        return false;
}
int main()
{
        int T;
        scanf("%d", &T);
        while (T--)
        {
                blues = reds = 0;
                for (int i = 0; i < 11; ++i)
                {
                        scanf("%s", table[i]);
                        for (int j = 0; j < 11; ++j)
                        {
                                if (table[i][j] == 'R')
                                        red[reds++] = make_pair(i, j);
                                else if (table[i][j] == 'B')
                                        blue[blues++] = make_pair(i, j);
                        }
                }
                if (proc(blue, blues, 'B'))
                        printf("Blue\n");
                else if (proc(red, reds, 'R'))
                        printf("Red\n");
                else
                        printf("No squares\n");
        }
}