#include <bits/stdc++.h>
using namespace std;
const int N=1e6+5,m=1e6;
int n;
int ex[N],ey[N];
vector<int> row[N],col[N];
int pl[N],pr[N];
bool ans[N];
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d%d",&ex[i],&ey[i]);
		row[ex[i]].push_back(i);
		col[ey[i]].push_back(i);
	}
	for(int i=1;i<=m;i++){
		sort(row[i].begin(),row[i].end(),[](int i,int j){return ey[i]<ey[j];});
		sort(col[i].begin(),col[i].end(),[](int i,int j){return ex[i]<ex[j];});
		if(!row[i].size()) continue;
		pl[i] = 0;
		pr[i] = row[i].size()-1;
		ans[row[i][pl[i]]] = 1;
		ans[row[i][pr[i]]] = 1;
	}
	for(int i=1;i<=m;i++){
		int up=-1,down=-1;
		for(int j=0;j<col[i].size();j++){
			if(ans[col[i][j]]) {up=j; break;}
		}
		for(int j=col[i].size()-1;j>=0;j--){
			if(ans[col[i][j]]) {down=j; break;}
		}
		if(up==-1) continue;
		//printf("%d %d\n",up,down);
		for(int j=up+1;j<down;j++){
			if(ans[col[i][j]]){
				int x = ex[col[i][j]];
				if(col[i][j] == row[x][pr[x]]) continue;
				ans[col[i][j]] = 0;
				pl[x]++;
				if(pl[x]>pr[x]) continue;
				ans[row[x][pl[x]]] = 1;
			}
		}
		
	}
	for(int i=m;i>=1;i--){
		int up=-1,down=-1;
		for(int j=0;j<col[i].size();j++){
			if(ans[col[i][j]]) {up=j; break;}
		}
		for(int j=col[i].size()-1;j>=0;j--){
			if(ans[col[i][j]]) {down=j; break;}
		}
		for(int j=up+1;j<down;j++){
			if(ans[col[i][j]]){
				ans[col[i][j]] = 0;
				int x = ex[col[i][j]];
				if(col[i][j] == row[x][pl[x]]) puts("?");
				pr[x]--;
				if(pl[x]>pr[x]) continue;
				ans[row[x][pr[x]]] = 1;
			}
		}
	}
	for(int i=1;i<=n;i++)
		printf("%d",ans[i]);
	return 0;
}