#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef std::vector vi; typedef std::vector vb; typedef std::vector vs; typedef std::vector vd; typedef std::vector vll; typedef std::vector > vvi; typedef vector vvvi; typedef vector vvll; typedef std::vector > vpi; typedef vector vvpi; typedef std::pair pi; typedef std::pair pll; typedef std::vector vpll; const long long mod = 1000000007; #define all(c) (c).begin(),(c).end() #define sz(c) (int)(c).size() #define forn(i, a, b) for(int i = a; i < b; i++) #define pb push_back #define mp make_pair int main() { int q; cin>>q; forn(i,0,q) { int n; cin>>n; vi x(n); vi y(n); forn(i,0,n) cin>>x[i]>>y[i]; vi x2=x; vi y2=y; x2.pb(-10000); x2.pb(10000); y2.pb(-10000); y2.pb(10000); bool ans = false; sort(all(y2)); sort(all(x2)); forn(i1,0,n+2) { forn(i2,i1+1,n+2) { forn(j1,0,n+2) { forn(j2,j1+1,n+2) { bool f = true; forn(i,0,n) { bool cur = false; if(x[i] == x2[i1] && (y[i] >= y2[j1] && y[i] <=y2[j2])) cur = true; if(x[i] == x2[i2] && (y[i] >= y2[j1] && y[i] <=y2[j2])) cur = true; if(y[i] == y2[j1] && (x[i] >= x2[i1] && x[i] <=x2[i2])) cur = true; if(y[i] == y2[j2] && (x[i] >= x2[i1] && x[i] <=x2[i2])) cur = true; f = f&&cur; } if(f) ans = true; } } } } if(ans) printf("YES\n"); else printf("NO\n"); } }