#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() 
{
    int n;
    cin >> n;
    
    while ( n-- > 0 )
    {
        int num;
        cin >> num;
        
        int flag = 0;
        
        long int myArrX[11];
        long int myArrY[11];
        for(int i = 0 ; i < num ; i++)
        {
            cin >> myArrX[i];
            cin >> myArrY[i];
        }
        
        int maxX = myArrX[0];
        int maxY = myArrY[0];
        for(int i = 0 ; i < num ; i++)
        {
            if(myArrX[i] == 0)
                if(myArrY[i] > maxY)
                    maxY = myArrY[i];
            if(myArrY[i] == 0)
                if(myArrX[i] > maxX)
                    maxX = myArrX[i];
        }
        
        for(int i = 0 ; i < num ; i++)
        {
            if(myArrX[i] != 0 && myArrY[i] != 0 )
            {
                int A = myArrY[i] - maxY;
                int B =(-1) * ( maxY / maxX ) * (myArrX[i] - maxX);
                if(A != B)
                    flag = 1;
            }
        }
        
        
        if(flag == 0)
            cout << "YES" << endl;
        else
            cout << "NO" << endl;
    }
    
    return 0;
}