#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string.h>
#include<queue>
#include<iostream>
#include<cmath>
using namespace std;
double x[10],y[10];
double dis[15];
double cal(double x1,double y1,double x2,double y2)
{
    double s;
    s = sqrt((x2-x1) * (x2-x1) + (y2-y1) * (y2-y1));
    return s;
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        for(int i=0;i<5;i++)
        {
            cin>>x[i]>>y[i];
        }
        int num=0;
        for(int i=0;i<5;i++)
        {
            for(int j=i+1;j<5;j++)
            {
                dis[num++]=cal(x[i],y[i],x[j],y[j]);
            }
        }
        
        sort(dis,dis+num);
        int flag=1;
        //cout<<dis[1]-dis[0]<<endl;
        for(int i=1;i<5;i++)
        {
            if(dis[i]-dis[i-1]>0.0001)
            {
                //cout<<"ddd";
                flag=0;
                break;
            }
        }
        for(int i=6;i<10;i++)
        {
            if(dis[i]-dis[i-1]>0.0001)
            {
                //cout<<"dd";
                flag=0;
                break;
            }
        }
        if(flag==1)
            cout<<"Yes"<<endl;
        else
            cout<<"No"<<endl;

    }
    //system("pause");
}