uva 10158

disjoint set 敵人好人之分

//============================================================================
// Name        : War.cpp
// Date : 2013/4/5 下午8:30:52
// Author : GCA
//============================================================================
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
    printf("%d ",dp[htx][hty]);}Pln();}
#define M 20200
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
    int tmp=min(x,y);
    return min(tmp,z);
}
int max3(int x,int y,int z){
    int tmp=max(x,y);
    return max(tmp,z);
}
int n;
int p[M],rank[M];
int nelse(int x){
    if(x>=n) return x-n;
    return x+n;
}
int getf(int x){
    if(x!=p[x])p[x]=getf(p[x]);
    return p[x];
}
void _union(int x,int y){
    x=getf(x);
    y=getf(y);
    if(rank[x]<rank[y]){
        p[x]=y;

    }else{
        p[y]=x;
        if(rank[x]==rank[y])rank[x]++;
    }
}
int main() {
    ios_base::sync_with_stdio(0);
    while(~scanf("%d",&n)){
        for(int i=0;i<M;i++){
            p[i]=i;
            rank[i]=0;
        }
        int c,x,y;
        while(~scanf("%d%d%d",&c,&x,&y)&&c+x+y){
            x=getf(x);
            int ox=getf(nelse(x));
            y=getf(y);
            int oy=getf(nelse(y));
            if(c==1){
                if((x==oy)||(y==ox)){
                    printf("-1\n");
                    continue;
                }
                _union(x,y);
                _union(ox,oy);
            }else if(c==2){
                if((x==y)||(ox==oy)){
                    printf("-1\n");
                    continue;
                }
                _union(x,oy);
                _union(y,ox);
            }else if(c==3){
                if(x==y||ox==oy)printf("1\n");
                else printf("0\n");
            }else{
                if(x==oy||ox==y)printf("1\n");
                else printf("0\n");
            }
        }
    }

}