#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
#include <complex>
using namespace std;
#define Ma_PI 3.141592653589793
#define eps 0.00000001
#define LONG_INF 3000000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define MOD 998244353
#define REP(i,n) for(long long i = 0;i < n;++i)    
#define seg_size 524288
double dot(complex<double> a, complex<double> b) {
	return a.real() * b.real() + a.imag() * b.imag();
}
double gyaku_dot(complex<double> a, complex<double> b) {
	return a.real() * b.imag() - a.imag() * b.real();
}
double leng(complex<double> a) {
	return sqrt(a.real()*a.real() + a.imag()*a.imag());
}
double angles(complex<double> a, complex<double> b) {
	double cosine = dot(a, b) / (leng(a) * leng(b));
	double sine = gyaku_dot(a, b) / (leng(a) * leng(b));
	double kaku = acos(cosine);
	if (sine <= 0) {
		kaku = 2 * Ma_PI - kaku;
	}
	return kaku;
}
vector<int> convex_hull(vector<complex<double>> a) {
	vector<int> ans;
	double now_minnest = a[0].real();
	int now_itr = 0;
	REP(i, a.size()) {
		if (now_minnest > a[i].real()) {
			now_minnest = a[i].real();
			now_itr = i;
		}
	}
	ans.push_back(now_itr);
	complex<double> ba(0, 1);
	while (true) {
		int now_go = 0;
		double now_min = 0;
		int starter = ans[ans.size() - 1];
		for (int i = 0; i < a.size();++i) {
			if (i != starter) {
				double goa = angles(ba, a[i] - a[starter]);
				if (goa > now_min) {
					now_min = goa;
					now_go = i;
				}
			}
		}
		if (now_go == ans[0]) break;
		ans.push_back(now_go);
		ba = complex<double>(a[now_go] - a[starter]);
	}
	return ans;
}
int nya[20] = {};
int gogo(int left, int right, int cnt);
int solve(int left, int right, int cnt) {
	int bad = 0;
	if (left != 1&&nya[left - 1] == 1) {
		bad = 1;
		if (cnt == 5 || gogo(left - 1, right, cnt + 1) == 1) {
			return 1;
		}
	}
	if (right != 13&&nya[right + 1] == 1) {
		bad = 1;
		if (cnt == 5 || gogo(left, right + 1, cnt + 1) == 1) {
			return 1;
		}
	}
	if (bad == 0) {
		if (gogo(left, right, cnt) == 1) {
			return 1;
		}
	}
	return 0;
}
int gogo(int left, int right, int cnt) {
	int bad = 0;
	if (left != 1 && nya[left - 1] == 0) {
		int used = right - left;
		used -= cnt;
		used++;
		bad = 1;
		if (used == 6 || solve(left - 1, right, cnt) == 0) {
			return 0;
		}
	}
	if (right != 13 && nya[right + 1] == 0) {
		int used = right - left;
		used -= cnt;
		used++;
		bad = 1;
		if (used == 6 || solve(left, right+1, cnt) == 0) {
			return 0;
		}
	}
	if (bad == 0) {
		if (solve(left, right, cnt) == 0) return 0;
	}
	return 1;
}
int main(){
	int n;
	cin >> n;
	REP(i, n) {
		for (int i = 1; i <= 14; ++i) {
			nya[i] = 0;
		}
		REP(q, 6) {
			int t;
			cin >> t;
			nya[t] = 1;
		}
		if (solve(7, 7, 0) == 1) {
			cout << "yes" << endl;
		}
		else {
			cout << "no" << endl;
		}
	}
	return 0;
}
