/***************************************
    codeforces = topcoder = sahedsohel
    IIT,Jahangirnagar University(42)
****************************************/
#include <bits/stdc++.h>
using namespace std;

#define ll long long int
#define ull unsigned long long int
#define inf (INT_MAX/10)
#define linf (LLONG_MAX/10LL)
#define sc(a) scanf("%d",&a)
#define sc2(a,b) scanf("%d%d",&a,&b)
#define sc3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define sc4(a,b,c,d) scanf("%d%d%d%d",&a,&b,&c,&d)
#define f(i,n) for(i=0;i<n;i++)
#define fl(c,i,n) for(i=c;i<n;i++)
#define mem(a) memset(a,0,sizeof(a))
#define memn(a) memset(a,-1,sizeof(a))
#define pb push_back
#define aov(a) a.begin(),a.end()
#define mpr make_pair
#define PI (2.0*acos(0.0)) //#define PI acos(-1.0)
#define xx first
#define yy second
#define mxv(a) *max_element(aov(a))
#define mnv(a) *min_element(aov(a))
#define LB(a,x) (lower_bound(aov(a),x)-a.begin())
#define UB(a,x) (upper_bound(aov(a),x)-a.begin())
#define to_c_string(a) a.c_str()
#define strtoint(c) atoi(&c[0])
#define pll pair< ll , ll >
#define pii pair< int , int >
#define pid pair< int , double >
#define pcs(a) printf("Case %d: ", a)
#define nl puts("")
#define endl '\n'
#define dbg(x) cout<<#x<<" : "<<x<<endl

template <class T> inline T bigmod(T p,T e,T M){ll ret = 1;for(; e > 0; e >>= 1){if(e & 1) ret = (ret * p) % M;p = (p * p) % M;}return (T)ret;}
template <class T> inline T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}
template <class T> inline T modinverse(T a,T M){return bigmod(a,M-2,M);}   // M is prime}
template <class T> inline T bpow(T p,T e){ll ret = 1;for(; e > 0; e >>= 1){if(e & 1) ret = (ret * p);p = (p * p);}return (T)ret;}

int toInt(string s){int sm;stringstream ss(s);ss>>sm;return sm;}
int toLlint(string s){long long int sm;stringstream ss(s);ss>>sm;return sm;}


///int mnth[]={-1,31,28,31,30,31,30,31,31,30,31,30,31};  //Not Leap Year
///int dx[]={2,1,-1,-2,-2,-1,1,2};int dy[]={1,2,2,1,-1,-2,-2,-1};//Knight Direction
///int dx[]={-1,+1,0,1,0,-1}; // Hexagonal Direction   **
///int dy[]={-1,+1,1,0,-1,0}; //                       *#*
///                                                     **
///const double eps=1e-9;
///int dx[]={0,1,0,-1};int dy[]={1,0,-1,0}; //4 Direction

/*****************************************************************/
/// ////////////////////   GET SET GO    ////////////////////// ///
/*****************************************************************/


#define intx(i,j,k,l) ((a[i]*b[j]-b[i]*a[j])*(a[k]-a[l])-(a[i]-a[j])*(a[k]*b[l]-b[k]*a[l]))/((a[i]-a[j])*(b[k]-b[l])-(b[i]-b[j])*(a[k]-a[l]))
#define inty(i,j,k,l) ((a[i]*b[j]-b[i]*a[j])*(b[k]-b[l])-(b[i]-b[j])*(a[k]*b[l]-b[k]*a[l]))/((a[i]-a[j])*(b[k]-b[l])-(b[i]-b[j])*(a[k]-a[l]))
#define dst(u,v,x,y) sqrt((x*1.0-u*1.0)*(x*1.0-u*1.0)+(y*1.0-v*1.0)*(y*1.0-v*1.0))

int ts,kk=1;

#define M 100005
#define MD 1000000007LL
#define MX 10001LL

int n;
int x[12],y[12],a[12],b[12];
int vs[(1<<10)];
#define area(p1,p2,p3) (x[p1]*y[p2]+x[p2]*y[p3]+x[p3]*y[p1]-y[p1]*x[p2]-y[p2]*x[p3]-y[p3]*x[p1])

int main()
{
    int t,i,j,k,l;

    sc(ts);
    while(ts--)
    {
        kk++;
        sc(n);
        f(i,n)
        {
            sc2(x[i],y[i]);
        }
        bool g=0;
        f(i,n)
        {
            f(j,n)
            {
                f(k,n)
                {
                    f(l,n)
                    {
                        f(t,n)
                        {
            if( x[t]==x[i]&&
               min(y[k],y[l])<=y[t]&&
               max(y[k],y[l])>=y[t]
                )continue;
            if( x[t]==x[j]&&
               min(y[k],y[l])<=y[t]&&
               max(y[k],y[l])>=y[t]
                )continue;
            if( y[t]==y[k]&&
               min(x[i],x[j])<=x[t]&&
               max(x[i],x[j])>=x[t]
                )continue;
            if( y[t]==y[l]&&
               min(x[i],x[j])<=x[t]&&
               max(x[i],x[j])>=x[t]
                )continue;
            break;
                        }
                        if(t==n)
                        {
//                            cerr<<x[i]<<" "<<x[j]<<endl;
//                            cerr<<y[k]<<" "<<y[l]<<endl;
                            g=1;
                            break;
                        }
                    }
                    if(g)break;
                }
                if(g)break;
            }
            if(g)break;
        }
        if(g)printf("YES\n");
        else printf("NO\n");
    }


    return 0;
}