#include<bits/stdc++.h>
#define MAXN 1000010
using namespace std;
struct coor{ int x, y, id; };
bool operator < (coor a, coor b){
    if(a.x == b.x) return a.y < b.y;
    return a.x < b.x;
}
bool operator > (coor a, coor b){
    if(a.x == b.x) return a.y > b.y;
    return a.x > b.x;
}
bool operator < (coor a, int b){
    return a.y < b;
}
bool operator > (coor a, int b){
    return a.y > b;
}
int n, nx, ny;
int dx[MAXN], dy[MAXN];
coor tower[MAXN];
namespace debug{
    int vis[500][500];
    bool cmp_by_id(coor a, coor b){ return a.id < b.id; }
    vector<coor> cntx[MAXN], cnty[MAXN];
    int check(int ans[]){
        sort(tower + 1, tower + n + 1, cmp_by_id);
        for(int i = 1; i <= n; i++){
            if(ans[i] == 1){
                cntx[tower[i].x].push_back(tower[i]);
                cnty[tower[i].y].push_back(tower[i]);
            }
        }
        for(int i = 1; i <= nx; i++) if((int)cntx[i].size() > 2) return i;
        for(int i = 1; i <= ny; i++) if((int)cnty[i].size() > 2) return i;
        for(int i = 1; i <= n; i++){
            if(ans[i] == 1) continue;
            if(cnty[tower[i].y].size() == 2){
                int x1 = cnty[tower[i].y][0].x, x2 = cnty[tower[i].y][1].x;
                if(x1 > x2) swap(x1, x2);
                if(x1 < tower[i].x && x2 > tower[i].x) continue;
            }
            if(cntx[tower[i].x].size() == 2){
                int y1 = cntx[tower[i].x][0].y, y2 = cntx[tower[i].x][1].y;
                if(y1 > y2) swap(y1, y2);
                if(y1 < tower[i].y && y2 > tower[i].y) continue;
            }
            return -1;
        }
        return 0;
    }
    void main(int ans[]){
        printf("%d\n",check(ans));
    }
    void print(int ans[]){
        sort(tower + 1, tower + n + 1, cmp_by_id);
        printf("--------------------------\n");
        for(int i = 1; i <= n; i++) printf("%d %d\n",tower[i].x,tower[i].y);
        printf("\n");
        for(int i = 1; i <= n; i++){
            if(ans[i] == 0) vis[tower[i].x][tower[i].y] = 1;
            else vis[tower[i].x][tower[i].y] = 2, printf("%d %d\n",tower[i].x,tower[i].y);
        }
        printf("\n");
        for(int i = 1; i <= nx; i++){
            for(int j = 1; j <= ny; j++) printf("%d ",vis[i][j]);
            printf("\n");
        }
    }
}
namespace baoli{
    vector<coor> cntx[MAXN], cnty[MAXN];
    int ans[20];
    bool check(){
        for(int i = 1; i <= n; i++){
            if(ans[i] == 1) continue;
            if(cnty[tower[i].y].size() == 2){
                int x1 = cnty[tower[i].y][0].x, x2 = cnty[tower[i].y][1].x;
                if(x1 > x2) swap(x1, x2);
                if(x1 < tower[i].x && x2 > tower[i].x) continue;
            }
            if(cntx[tower[i].x].size() == 2){
                int y1 = cntx[tower[i].x][0].y, y2 = cntx[tower[i].x][1].y;
                if(y1 > y2) swap(y1, y2);
                if(y1 < tower[i].y && y2 > tower[i].y) continue;
            }
            return false;
        }
        return true;
    }
    void dfs(int now){
        if(now > n){
            if(check()){
                for(int i = 1; i <= n; i++) printf("%d",ans[i]);
                printf("\n");
                exit(0);
            }
            return ;
        }
        if(cntx[tower[now].x].size() <= 1 && cnty[tower[now].y].size() <= 1){
            cntx[tower[now].x].push_back(tower[now]);
            cnty[tower[now].y].push_back(tower[now]);
            ans[now] = 1; dfs(now + 1); ans[now] = 0;
            cntx[tower[now].x].pop_back();
            cnty[tower[now].y].pop_back();
        }
        dfs(now + 1);
    }
    void main(){
        dfs(1);
    }
}
namespace sp1{
    int cntx[MAXN], miny[MAXN], maxy[MAXN], ans[MAXN];
    bool check_sp1(){
        for(int i = 1; i <= n; i++) cntx[tower[i].x]++;
        for(int i = 1; i <= nx; i++) if(cntx[i] > 2) return false;
        return true;
    }
    void main(){
        for(int i = 1; i <= n; i++) if(miny[tower[i].y] == 0 || tower[miny[tower[i].y]].x > tower[i].x) miny[tower[i].y] = i;
        for(int i = 1; i <= n; i++) if(maxy[tower[i].y] == 0 || tower[maxy[tower[i].y]].x < tower[i].x) maxy[tower[i].y] = i;
        for(int i = 1; i <= ny; i++){
            if(miny[i] != 0) ans[miny[i]] = 1;
            if(maxy[i] != 0) ans[maxy[i]] = 1;
        }
        for(int i = 1; i <= n; i++) printf("%d",ans[i]);
        printf("\n");
    }
}
namespace gouzao{
    vector<coor> tx[MAXN]; // x 坐标为 i 的塔的集合
    int idx[MAXN]; // x 坐标为 i 时所选择的 y 坐标较小的塔
    int ans[MAXN], res[MAXN];
    void from_r_to_l(int op){
        priority_queue<int> cy[MAXN]; // y 坐标为 i 时已选择的塔的 x 坐标的集合
        for(int i = 1; i <= n; i++) if(ans[tower[i].id]) cy[tower[i].y].push(tower[i].x);
        for(int i = 1; i <= nx; i++) idx[i] = tx[i].size() - 1;
        for(int i = ny; i >= 1; i--){
            if(cy[i].empty()) continue;
            idx[cy[i].top()]--; cy[i].pop();
            while(cy[i].size() > 1){
                int now = cy[i].top(); cy[i].pop();
                // while(idx[now] >= 0 && tx[now][idx[now]].y != i) idx[now]--;
                idx[now] = lower_bound(tx[now].begin(), tx[now].begin() + idx[now] + 1, i) - tx[now].begin();
                if(idx[now] - op < 0) continue;
                if(ans[tx[now][idx[now]].id] == 0) continue;
                ans[tx[now][idx[now]].id] = 0; idx[now]--;
                if(idx[now] >= 0 && ans[tx[now][idx[now]].id] == 0){
                    cy[tx[now][idx[now]].y].push(now);
                    ans[tx[now][idx[now]].id] = 1;
                }
            }
            if(!cy[i].empty()){
                idx[cy[i].top()]--;
                cy[i].pop();
            }
        }
    }
    void from_l_to_r(int op){
        priority_queue<int> cy[MAXN]; // y 坐标为 i 时已选择的塔的 x 坐标的集合
        for(int i = 1; i <= n; i++) if(ans[tower[i].id]) cy[tower[i].y].push(tower[i].x);
        for(int i = 1; i <= nx; i++) idx[i] = 0;
        for(int i = 1; i <= ny; i++){
            if(cy[i].empty()) continue;
            cy[i].pop();
            while(cy[i].size() > 1){
                int now = cy[i].top(); cy[i].pop();
                // while(idx[now] < (int)tx[now].size() && tx[now][idx[now]].y != i) idx[now]++;
                idx[now] = lower_bound(tx[now].begin(), tx[now].begin() + idx[now] + 1, i) - tx[now].begin();
                if(idx[now] + op >= (int)tx[now].size()) continue;
                if(ans[tx[now][idx[now]].id] == 0) continue;
                ans[tx[now][idx[now]].id] = 0; idx[now]++;
                if(idx[now] < (int)tx[now].size() && ans[tx[now][idx[now]].id] == 0){
                    cy[tx[now][idx[now]].y].push(now);
                    ans[tx[now][idx[now]].id] = 1;
                }
            }
        }
    }
    void radix_sort(int n, coor a[]){
        coor *b = new coor[n];
        int *cnt = new int[1 << 16];
        int mask = (1 << 16) - 1;
        coor *x = a, *y = b;
        for(int i = 0; i < 32; i += 16){
            for(int j = 0; j < (1 << 16); j++) cnt[j] = 0;
            for(int j = 0; j < n; j++) ++cnt[x[j].y >> i & mask];
            for(int sum = 0, j = 0; j < (1 << 16); j++){
                sum += cnt[j]; cnt[j] = sum - cnt[j];
            }
            for(int j = 0; j < n; j++) y[cnt[x[j].y >> i & mask]++] = x[j];
            swap(x, y);
        }
        for(int i = 0; i < 32; i += 16){
            for(int j = 0; j < (1 << 16); j++) cnt[j] = 0;
            for(int j = 0; j < n; j++) ++cnt[x[j].x >> i & mask];
            for(int sum = 0, j = 0; j < (1 << 16); j++){
                sum += cnt[j]; cnt[j] = sum - cnt[j];
            }
            for(int j = 0; j < n; j++) y[cnt[x[j].x >> i & mask]++] = x[j];
            swap(x, y);
        }
        delete[] cnt; delete[] b;
    }
    void main(){
        // sort(tower + 1, tower + n + 1);
        radix_sort(n, tower + 1);
        for(int i = 1; i <= n; i++) tx[tower[i].x].push_back(tower[i]);
        for(int i = 1; i <= nx; i++){
            if(idx[i] < (int)tx[i].size()){
                ans[tx[i][0].id] = 1;
                ans[tx[i].back().id] = 1;
            }
        }
        for(int i = 1; i <= 4; i++){
            from_l_to_r(1);
            from_r_to_l(1);
        }
        from_l_to_r(0);

        for(int i = 1; i <= n; i++) printf("%d",ans[i]);
        printf("\n");
    }
}
void radix_sort(int n, int a[]){
    int *b = new int[n];
    int *cnt = new int[1 << 8];
    int mask = (1 << 8) - 1;
    int *x = a, *y = b;
    for(int i = 0; i < 32; i += 8){
        for(int j = 0; j < (1 << 8); j++) cnt[j] = 0;
        for(int j = 0; j < n; j++) ++cnt[x[j] >> i & mask];
        for(int sum = 0, j = 0; j < (1 << 8); j++){
            sum += cnt[j]; cnt[j] = sum - cnt[j];
        }
        for(int j = 0; j < n; j++) y[cnt[x[j] >> i & mask]++] = x[j];
        swap(x, y);
    }
    delete[] cnt;
    delete[] b;
}
int main(){
    // freopen("data.in", "r", stdin);
    // freopen("my.out", "w", stdout);
    // freopen("tower4.in", "r", stdin);
    // freopen("tower.out", "w", stdout);
    scanf("%d",&n);
    for(int i = 1; i <= n; i++) scanf("%d%d",&tower[i].y,&tower[i].x), tower[i].id = i;
    for(int i = 1; i <= n; i++) dx[i] = tower[i].x, dy[i] = tower[i].y;
    // sort(dx + 1, dx + n + 1); sort(dy + 1, dy + n + 1);
    radix_sort(n, dx + 1); radix_sort(n, dy + 1);
    nx = unique(dx + 1, dx + n + 1) - dx - 1;
    ny = unique(dy + 1, dy + n + 1) - dy - 1;
    for(int i = 1; i <= n; i++) tower[i].x = lower_bound(dx + 1, dx + nx + 1, tower[i].x) - dx;
    for(int i = 1; i <= n; i++) tower[i].y = lower_bound(dy + 1, dy + ny + 1, tower[i].y) - dy;
    gouzao::main();
    return 0;
}