///==================================================/// /// HELLO WORLD !! /// /// IT'S ME /// /// BISHAL GAUTAM /// /// [ bsal.gautam16@gmail.com ] /// ///==================================================/// #include #define X first #define Y second #define mpp make_pair #define nl printf("\n") #define SZ(x) (int)(x.size()) #define pb(x) push_back(x) #define pii pair #define pll pair ///--------------------- #define S(a) scanf("%d",&a) #define P(a) printf("%d",a) #define SL(a) scanf("%lld",&a) #define S2(a,b) scanf("%d%d",&a,&b) #define SL2(a,b) scanf("%lld%lld",&a,&b) ///------------------------------------ #define all(v) v.begin(),v.end() #define CLR(a) memset(a,0,sizeof(a)) #define SET(a) memset(a,-1,sizeof(a)) #define fr(i,a,n) for(int i=a;i<=n;i++) using namespace std; typedef long long ll; /// Digit 0123456789012345678 /// #define MX 100005 #define inf 2000000010 #define MD 1000000007 #define eps 1e-9 ///===============================/// int n,p[22]; pii pp[22],qq[22]; vectorvx,vy; int main() { int tc,x,y,i,j; S(tc); while(tc--){ S(n); vx.clear(); vy.clear(); for(i=0;i=vy[k] || x==vx[j]&&y<=vy[l]&&y>=vy[k] || y==vy[k]&&x>=vx[i]&&x<=vx[j] || y==vy[l]&&x>=vx[i]&&x<=vx[j] ){ cnt++; } else break; } if( cnt==n ){ // cout<