#include<math.h>
#include<stdio.h>
#include<iomanip>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long double ld;
const ld EPS=1e-4;
struct Point
{
    ld x,y;
    friend ld dis(Point a,Point b)
    {
        return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);
    }
}a[10];
ld map[10][10];
int main()
{
    int c,T,n=5,m,i,j,k;
    cin>>T;
    for(c=1;c<=T;c++)
    {
        bool flag=1;
        for(i=1;i<=5;i++)
        {
            cin>>a[i].x>>a[i].y;
        }
        for(i=1;i<=5;i++)
        {
            for(j=1;j<=5;j++)
            {
                map[i][j]=dis(a[i],a[j]);
            }
            sort(map[i]+1,map[i]+6);
            if(fabs(map[i][2]-map[i][3])>EPS||fabs(map[i][4]-map[i][5])>EPS)
            {
                flag=0;
            }
        }
        if(flag)
            puts("Yes");
        else
            puts("No");
    }
    return 0;
}