//BestCoder #62 1001
//write by Lone Wolf in 2015.11.14
#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define sspeed ios_base::sync_with_stdio(0);cin.tie(0)
typedef long long LL;
using namespace std;
const int MOD=1000000007;
const int INF=0x3f3f3f3f;
const int N=100010;
const int M=100010;
const int Mat=110;
typedef double Matrix[Mat][Mat];
const double eps=1e-10;
inline int readint()
{
    char c=getchar();
    while (c<'0'||c>'9') c=getchar();
    int x=0;
    while ('0'<=c&&c<='9')
    {
        x=x*10+c-'0';
        c=getchar();
    }
    return x;
}
int buf[10];
inline void writeint(int i)
{
    int p=0;
    if (i==0) p++;
    else while (i)
    {
        buf[p++]=i%10;
        i/=10;
    }
    for (int j=p-1;j>=0;j--) putchar('0'+buf[j]);
}
int n,m;
struct node
{
    double x,y;
};
node A[10];
double del(node x,node y)
{
    return fabs(sqrt((x.x-y.x)*(x.x-y.x)+(x.y-y.y)*(x.y-y.y)));
}
vector <double> S;
bool Is(int x)
{
    if (fabs(S[x]-S[x-1])<0.0001f) return false;
    return true;
}
void solve()
{
    int i,j,k;
    S.clear();
    for (i=1;i<=5;i++)
    {
        scanf("%lf%lf",&A[i].x,&A[i].y);
        for (j=1;j<i;j++)
        {
            S.push_back(del(A[i],A[j]));
        }
    }
    sort(S.begin(),S.end());
    int ans=0;
    for (i=1;i<S.size();i++)
        if (Is(i)) ans++;
    if (ans==1) printf("Yes\n");
    else printf("No\n");
    return;
}
int main()
{
    //freopen("test.in","r",stdin);
    //freopen("test.out","w",stdout);
    int i,T=1;
    scanf("%d",&T);
    for (i=1;i<=T;i++)
    {
        solve();
    }
    return 0;
}