#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <tuple>
#include <functional>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define piii pair<int, pii>
#define plll pair<long long, pll>
#define tiii tuple<int, int, int>
#define tiiii tuple<int, int, int, int>
#define ff first
#define ss second
#define ee ss.ff
#define rr ss.ss
const int INF = (int)1e9 + 7;

using namespace std;

const int MAXN = 1'000'005;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n; cin >> n;
    pii A[n]; for(auto &i : A) cin >> i.ff >> i.ss;

    vector<int> yls[MAXN];
    for(int i = 0; i < n; ++i) yls[A[i].ss].push_back(i);
    vector<int> xls[MAXN];
    for(int i = 0; i < MAXN; ++i) for(auto j : yls[i]) xls[A[j].ff].push_back(j);

    pii xl[MAXN], yl[MAXN];
    fill(xl, xl + MAXN, pii{-1, -1});
    fill(yl, yl + MAXN, pii{-1, -1});
    string s(n, '0');

    function<void(int)> f = [&](int i)
    {
        int y = A[i].ss;
        s[i] = '1';
        if(yl[y].ff == -1) yl[y].ff = i;
        else if(yl[y].ss == -1) yl[y].ss = i;
        else
        {
            int B[3] = { yl[y].ff, yl[y].ss, i };
            sort(B, B + 3, [&](int x, int y){ return A[x].ff < A[y].ff; });
            yl[y].ff = B[0];
            yl[y].ss = B[2];
            i = B[1];
            s[i] = '0';
            if(xl[A[i].ff].ff == xl[A[i].ss].ss) xl[A[i].ff].ff = xl[A[i].ff].ss = -1;
            else
            {
                if(xls[A[i].ff][xl[A[i].ff].ff] == i) if(++xl[A[i].ff].ff != xl[A[i].ff].ss) f(xls[A[i].ff][xl[A[i].ff].ff]);
                else if(--xl[A[i].ff].ss == xl[A[i].ff].ff) f(xls[A[i].ff][xl[A[i].ff].ss]);
            }
        }
    };

    for(int i = 0; i < MAXN; ++i) if(xls[i].size())
    {
        if(xls[i].size() == 1)
        {
            xl[i].ff = xl[i].ss = 0;
            f(xls[i][0]);
        }
        else
        {
            xl[i].ff = 0;
            f(xls[i][0]);
            xl[i].ss = (int)xls[i].size() - 1;
            f(xls[i].back());
        }
    }

    cout << s;
}