// define me AcrossTheSky
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <ctime>
#include <queue>
using namespace std;
typedef long long ll;

struct NODE{
    double x,y;
} node[10];
const double p=1e-4;

bool judge(double x,double y){
    if (fabs(x-y)<=p) return true;
    return false;
}
double calc(int a,int b){
    return (sqrt((node[a].x-node[b].x)*(node[a].x-node[b].x)+(node[a].y-node[b].y)*(node[a].y-node[b].y)));
}
int main(){
    int cas; cin >> cas;
    while (cas--){
        int n=5;
        for (int i=1;i<=n;i++) scanf("%lf%lf",&node[i].x,&node[i].y);
        
        bool flag=true;
        double edge=1<<30;
        for (int i=1;i<=n;i++){
            double fmax=1<<30,smax=1<<30;
            for (int j=1;j<=n; j++) if (j!=i)
            {
                double x=calc(i,j);
                if (!judge(fmax,x) && x<fmax) fmax=x;
                else if (fmax!=1<<30 && x<smax) smax=x;
            }
            if (!judge(fmax,smax)) {flag=false; break;}
            if (edge==1<<30) edge=fmax;
            else if (!judge(fmax,edge)) {flag=false; break;}
        }
        if (flag) cout << "Yes" << endl;
        else cout << "No" << endl;
    }
}