#include<bits/stdc++.h> using namespace std; const int N=1e6+10,V=1e6+2; int n; vector<int> T[N],W[N]; int x[N],y[N],P[N],u[N],d[N]; bool _[N],G[N]; queue<int> q; void I(int id){ W[x[id]].push_back(id); if(W[x[id]].size()>2&&!_[x[id]]){ _[x[id]]=1;q.push(x[id]); }G[id]=1; } int main(){ //freopen("cons.in","r",stdin); //freopen("cons.out","w",stdout); ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin>>n; for(int i=1;i<=n;i++) cin>>x[i]>>y[i]; for(int i=1;i<=n;i++){ T[y[i]].push_back(i); } for(int i=1;i<=V;i++){ sort(T[i].begin(),T[i].end(),[&](int a,int b){ return x[a]<x[b]; }); for(int j=0;j<T[i].size();j++){ P[T[i][j]]=j; if(j==0||j==T[i].size()-1){ I(T[i][j]); } }u[i]=0,d[i]=T[i].size()-1; } while(!q.empty()){ int p=q.front();q.pop(); sort(W[p].begin(),W[p].end(),[&](int a,int b){ return y[a]<y[b]; });_[p]=0; for(int i=1;i+1<W[p].size();i++){ int z=W[p][i];G[z]=0; if(T[y[z]].size()>1&&u[y[z]]+1<d[y[z]]){ if(P[z]==d[y[z]]){ d[y[z]]--;I(T[y[z]][d[y[z]]]); }else if(P[z]==u[y[z]]){ u[y[z]]++;I(T[y[z]][u[y[z]]]); } } }int a=W[p].front(),b=W[p].back(); W[p].clear();W[p].push_back(a);W[p].push_back(b); } for(int i=1;i<=n;i++) cout<<G[i]; return 0; }