#include <bits/stdc++.h>
using namespace std;
const int N=1e6+5;
int n,m=1e6;
int ex[N],ey[N];
vector<int> col[N],t;
int L[N],R[N];
set<int> row[N];
bool ans[N];
queue<int> q;
void Insert(int id){
	ans[id] = 1;
	row[ex[id]].insert(ey[id]);
	if(row[ex[id]].size()>2) q.push(ex[id]);
}
void Delete(int id){
	ans[id] = 0;
	// cout<<id<<endl;
	row[ex[id]].erase(ey[id]);
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d%d",&ex[i],&ey[i]);
		col[ey[i]].push_back(i);
	}
	for(int i=1;i<=m;i++){
		if(!col[i].size()) continue;
		sort(col[i].begin(),col[i].end(),[](int i,int j){return ex[i]<ex[j];});
		L[i] = 0;
		R[i] = col[i].size()-1;
		Insert(col[i][L[i]]);
		if(L[i]!=R[i]) Insert(col[i][R[i]]);
	}
	while(q.size()){
		int x = q.front();
		// cout<<x<<endl;
		q.pop();
		if(row[x].size()<=2) continue;
		int Ly=*row[x].begin(),Ry=*row[x].rbegin();
		t.clear();
		for(int y:row[x]) if(y!=Ly && y!=Ry) t.push_back(y);
		for(int y:t){
			if(y==Ly || y==Ry) continue;
			// cout<<x<<' '<<y<<' '<<L[y]<<' '<<R[y]<<endl;
			if(L[y]>R[y]) continue;
			if(L[y]==R[y]) Delete(col[y][L[y]++]);
			else if(x==ex[col[y][L[y]]]){
				Delete(col[y][L[y]++]);
				if(L[y]<R[y]) Insert(col[y][L[y]]);
			}
			else{
				Delete(col[y][R[y]--]);
				if(L[y]<R[y]) Insert(col[y][R[y]]);
			}
			// cout<<"over"<<endl;
		}
		// cout<<endl;
	}
	for(int i=1;i<=n;i++) printf("%d",ans[i]);
	return 0;
}