#include<bits/stdc++.h>
#define rep(i, j, k) for(int i=(j); i<=(k); ++i)
#define per(i, j, k) for(int i=(j); i>=(k); --i)
#define siz(x) (int)x.size()
#define ck
using namespace std;
namespace DEBUG{
    template<class T>
    void _debug(const char *s, T x){ cout<<s<<'='<<x<<'\n'; }
    template<class T, class... T2>
    void _debug(const char *s, T x, T2... nxt){
        while(*s!=',') cout<<*s++;
        cout<<'='<<x<<',';
        _debug(s+1, nxt...);
    }
    #ifdef ck
    #define debug(...) 0
    #else
    #define debug(...) _debug(#__VA_ARGS__, __VA_ARGS__)
    #endif
} using namespace DEBUG;
using pa=pair<int, int>;
const int N=1e6+7;
int n, maxn, hl[N], hr[N], up[N], down[N], ans[N];
vector<int> p[N];
pair<pa, int> z[N];
void clear(int r){hl[r]=hr[r]=-1;}
void get(int c){if(down[c]<up[c]) swap(down[c], up[c]);}
//down>up
void upd(int r){
    if(r==-1) return;
    int &x=hl[r], &y=hr[r];
    auto &p=::p[r];
    if(x==-1 && y==-1) return;
    while(x<=y && up[p[x]]<r && r<down[p[x]]) ++x;
    while(x<=y && up[p[y]]<r && r<down[p[y]]) --y;
    if(x>y) return clear(r);
    int d1=0, d2=0;
    if(up[p[x]]!=r && down[p[x]]!=r){
        if(up[p[x]]==-1) up[p[x]]=r, get(p[x]);
        else if(down[p[x]]==-1) down[p[x]]=r, get(p[x]);
        else{
            if(r<up[p[x]]){
                int tmp=up[p[x]];
                up[p[x]]=r;
                d1=tmp;
            } else{
                int tmp=down[p[x]];
                down[p[x]]=r;
                d1=tmp;
            }
        }
    } 
    if(up[p[y]]!=r && down[p[y]]!=r){
        if(up[p[y]]==-1) up[p[y]]=r, get(p[y]);
        else if(down[p[y]]==-1) down[p[y]]=r, get(p[y]);
        else{
            if(r<up[p[y]]){
                int tmp=up[p[y]];
                up[p[y]]=r;
                d2=tmp;
            } else{
                int tmp=down[p[y]];
                down[p[y]]=r;
                d2=tmp;
            }
        }
    }
    if(d1) upd(d1);
    if(d2 && d1!=d2) upd(d2);
}

int check(int l, int mid, int r){
    return l<mid && mid<r || r<mid && mid<l;
}

bool check(pa l, pa mid, pa r){
    bool res=0;
    if(l.first==mid.first && mid.first==r.first)
        res|=check(l.second, mid.second, r.second);
    if(l.second==mid.second && mid.second==r.second);
        res|=check(l.first, mid.first, r.first);
    return res;
}

void check(){
    static pa p[N];
    rep(i, 1, n) p[z[i].second]=z[i].first;
    static int cnt[N];
    rep(i, 1, n) if(ans[i]) ++cnt[p[i].first];
    rep(i, 1, maxn) assert(cnt[i]<=2);
    memset(cnt, 0, sizeof cnt);
    rep(i, 1, n) if(ans[i]) ++cnt[p[i].second];
    rep(i, 1, maxn) assert(cnt[i]<=2);
    rep(i, 1, n){
        if(ans[i]) continue;
        bool flag=0;
        rep(j, 1, n) rep(k, 1, n) if(ans[j] && ans[k]){
            if(check(p[j], p[i], p[k])){
                flag=1;
                break;
            }
        }
        assert(flag);
    }
}

signed main(){
    cin.tie(0)->sync_with_stdio(0);
    cin>>n;
    rep(i, 1, n){
        int x, y;
        cin>>x>>y;
        z[i]=make_pair(pa(x, y), i);
        maxn=max({maxn, x, y});
        p[x].emplace_back(y);
    }
    rep(i, 1, maxn) sort(p[i].begin(), p[i].end());
    memset(hl, -1, sizeof hl);
    memset(hr, -1, sizeof hr);
    memset(down, -1, sizeof down);
    memset(up, -1, sizeof up);
    rep(i, 1, maxn){
        if(siz(p[i])==0) continue;
        hl[i]=0, hr[i]=siz(p[i])-1;
        upd(i);
    }
    sort(z+1, z+n+1);
    rep(i, 1, maxn){
        pa x;
        if(hl[i]!=-1){
            x=pa(i, p[i][hl[i]]);
            debug(x.first, x.second);
            int pos=lower_bound(z+1, z+n+1, make_pair(x, 0))-z;
            ans[z[pos].second]=1;
        } if(hr[i]!=-1 && hr[i]!=hl[i]){
            x=pa(i, p[i][hr[i]]);
            debug(x.first, x.second);
            int pos=lower_bound(z+1, z+n+1, make_pair(x, 0))-z;
            ans[z[pos].second]=1;
        }
    }
    check();
    rep(i, 1, n) cout<<ans[i];
}