//----->|try=0; while(!success) try++;|<------ //----->|Belief Yourself,Respect Yourself|<---- //----->|Be Proud Of Yourself,You're Doing Your best|<----- #include using namespace std; #define uniq(x) x.erase(unique(x.begin(),x.end()), x.end()) //Unique value find from vector #define upper(arr,n,fixed) upper_bound(arr,arr+n,fixed)-arr //Upper value search; #define lower(arr,n,fixed) upper_bound(arr,arr+n,fixed)-arr //Lower value search; #define max3(a,b,c) max(max(a,b),c)//maximum value find three value; #define min3(a,b,c) min(min(a,b),c)//minimum value find three value; #define rep(i, n) for(int i = 0; i < n; ++i) #define REP(i, n) for(int i = 1; i <= n; ++i) #define rep1(i,start,n) for(int i=start;i T POW(T b,T p) //Pow calculation { T r=1; while(p) { if(p&1)r=(r*b); b=(b*b); p>>=1; } return r; } template T BigMod(T b,T p,T m) //BigMod Calculation { T r=1; while(p) { if(p&1)r=(r*b)%m; b=(b*b)%m; p>>=1; } return r; } //||--------------------------->||Main_Code_Start_From_Here||<---------------------------------|| int main() { //freopen("a.in", "r", stdin); //freopen("a.out", "w", stdout); int test,n,x,y,ar[101][101]; cin>>test; while(test--) { cin>>n; int flag=0; int yes=0; rep(i,n) { cin>>x>>y; if(x==y && x!=0 && y!=0) { flag=1; } //cout<<"pass"<