#include <stdio.h>
#include <cmath>
using namespace std;

#define min(x, y) (x < y?x : y)
double x[5], y[5], d[5][5], str[10];
double dist(int a, int b)
{
    double dx = x[a]-x[b], dy = y[a]-y[b];
    double d = dx*dx + dy*dy;
    return d;
}
bool comp(double a, double b)
{
    if (abs(a-b) < 0.0001) return true;
    return false;
}

int main()
{
    int T, i, j, k, h, flag; scanf("%d", &T);
    while (T--)
    {
        for (i = 0; i < 5; i++)
            scanf("%lf %lf", &x[i], &y[i]);
        for (i = 0, k = 0, flag = 0; i < 5; i++)
        {
            for (j = i+1; j < 5; j++)
            {
                d[i][j] = dist(i, j);
                for (h = 0; h < k; h++)
                    if (comp(str[h], d[i][j])) break;
                if (h == k) str[k++] = d[i][j];
                if (k == 3) {
                    printf("No\n");
                    flag = 1;
                    break;
                }
            }
            if (flag == 1) break;
        }
        if (flag == 0) printf("Yes\n");
    }
}