#include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <cstdlib>

 #include <cmath>

 #include <algorithm>

 #include <string>

 #include <queue>

 #include <stack>

 #include <vector>

 #include <map>

 #include <set>

 #include <functional>

 #include <time.h>

 using namespace std;

 const int INF = <<;

 const double eps = 1e-;

 double a[];

 inline double myAbs(double x) {

     return x> ? x : -x;

 }

 bool dfs(double S[], int cnt) { //S[]中存放当前还有的数字

 //计算方法： 每次从剩下的数字里取出两个数运算，相当于枚举运算顺序

     if (cnt==) //最后一个数字

         return myAbs(-S[])<eps;

     double b[];

     for (int i = ; i < cnt; i++) //枚举两个运算的数字

         for (int j = ; j < cnt; j++) if (i!=j) {

             for (int k = , p = ; k < cnt; k++) {

                 if (k!=i&&k!=j)

                     b[p++] = S[k];

             }

             //枚举运算

             b[] = S[i]+S[j];

             if (dfs(b, cnt-)) return true;

             b[] = S[i]-S[j];

             if (dfs(b, cnt-)) return true;

             b[] = S[i]*S[j];

             if (dfs(b, cnt-)) return true;

             b[] = S[i]/S[j];

             if (dfs(b, cnt-)) return true;

         }

     return false;

 }

 void solve() {

     do { //枚举排列

         if (dfs(a, )) {

             puts("YES");

             return ;

         }

     }while (next_permutation(a, a+));

     puts("NO");

 }

 int main() {

     #ifdef Phantom01

         freopen("HNU12879.txt", "r", stdin);

     #endif //Phantom01

     int T;

     scanf("%d", &T);

     while (T--) {

         for (int i = ; i < ; i++)

             scanf("%lf", &a[i]);

         solve();

     }

     return ;

 }