记录9个数
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
bool check[3][10];
int a147[3];
int a258[3];
int a369[3];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
fill(check[0], check[0] + 30, 0);
fill(a147, a147 +3, 0);
fill(a147, a147 +3, 0);
fill(a147, a147 +3, 0);
for (int j = 0; j < 7; j++) {
string str;
cin >> str;
int num = str[0] - '0';
if (str[1] == 'T') {
check[2][num] = true;
}
if (str[1] == 'B') {
check[1][num] = true;
}
if (str[1] == 'W') {
check[0][num] = true;
}
}
for (int i = 0; i < n; i++) {
a147[i] = check[i][1] + check[i][4] + check[i][7];
a258[i] = check[i][2] + check[i][5] + check[i][8];
a369[i] = check[i][3] + check[i][6] + check[i][9];
}
bool flag = true;
for (int i = 0; i < 3 && flag; i++) {
for (int j = 0; j < 3 && flag; j++) {
for (int k = 0; k < 3 && flag; k++) {
if (i != j && j != k && i != k) {
if (a147[i] + a258[j] + a369[k] == 7) {
flag = false;
}
}
}
}
}
if (flag) {
puts("NO");
}
else {
puts("YES");
}
}
return 0;
}