#include <cmath>
#include <cstdio>
#include <vector>
#include<set>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
ll gcd(ll a,ll b)
    {
    if(b==0)
        return a;
    else return gcd(b,a%b);
}
int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    int t,i,j,k,n;
    cin>>t;
    while(t--)
        {
        cin>>n;
        ll x[n],y[n];
        for(i=0;i<n;i++)
            {
            cin>>x[i]>>y[i];
        }
        if(n>=2)
            {
            cout<<"YES\n";
            continue;
        }
        else 
            {
           set<pair<int,int> >s;
            int d=x[1]-x[0];
            int e=y[1]-y[0];
            int rp=gcd(abs(d),abs(e));
            s.insert(make_pair((x[1]-x[0])/rp,(y[1]-y[0])/rp));
                     d=x[2]-x[0];
                     e=y[2]-y[0];
                     rp=gcd(abs(d),abs(e));
                     {
                         s.insert(make_pair(d/rp,e/rp));
                     }
                       d=x[2]-x[1];
                     e=y[2]-y[1];
                     rp=gcd(abs(d),abs(e));
                     {
                         s.insert(make_pair(d/rp,e/rp));
                     }
                     int f=1;
            for(i=3;i<n;i++)
                {
                pair<int,int>p,q;
                    d=x[i]-x[0];
                    e=y[i]-y[0];
                    rp=gcd(abs(d),abs(e));
                p=make_pair((x[i]-x[0])/rp,(y[i]-y[0])/rp);
                     d=x[i]-x[1];
                    e=y[i]-y[1];
                    rp=gcd(abs(d),abs(e));
                q=make_pair((x[i]-x[1])/rp,(y[i]-y[1])/rp);
                    if(s.find(p)==s.end() && s.find(q)==s.end())
                        {
                        f=0;
                        break;
                    }
                if(f==0)
                    break;
               
            }
                     if(f==1)
                     {
                         cout<<"YES\n";
                     }
                     else 
                     {cout<<"NO\n";}
        }
                     }
    return 0;
}