#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) ((int)((x).size()))
#define int ll
// #define N 
using namespace std;
const int Lim=1000000,N=1000005;
int n,x[N],y[N];
poly G[N];
int L[N],R[N];
int ans[N];
set<int>S[N];
queue<int>q;
int tot=0;
int ins[N];
inline void chk(int i)
{
    if (S[i].size()>=3) 
    {
        if (!ins[i]) ins[i]=1,q.push(i),tot++;
    }
}
inline void recalc(int i)
{
    if (L[i]>R[i]) return;
    S[y[G[i][L[i]]]].insert(i);chk(y[G[i][L[i]]]);
    S[y[G[i][R[i]]]].insert(i);chk(y[G[i][R[i]]]);
}
void BellaKira()
{
    cin>>n;
    for (int i=1;i<=n;i++)
    {
        cin>>x[i]>>y[i];
        G[x[i]].push_back(i);
    }
    for (int i=1;i<=Lim;i++)
    {
        sort(G[i].begin(),G[i].end(),[&](int a,int b)
        {
            return y[a]<y[b];
        });
        L[i]=0,R[i]=sz(G[i])-1;
    }
    for (int i=1;i<=Lim;i++) 
    {
        recalc(i);
    }
    while (!q.empty())
    {
        int u=q.front();
        q.pop();
        ins[u]=0;
        if (S[u].size()<=2) continue;
        auto itl=S[u].begin();
        ++itl;
        auto itr=itl;
        poly g;
        while (1)
        {
            ++itr;
            if (itr==S[u].end()) break;
            g.push_back(*itl);
            ++itl;
        }
        S[u].erase(itl,itr);
        for (auto v:g)
        {
            if (y[G[v][R[v]]]==u) R[v]--;
            if (y[G[v][L[v]]]==u) L[v]++; 
            recalc(v);
        }
    }
    for (int i=1;i<=Lim;i++)
        if (L[i]<=R[i]) ans[G[i][L[i]]]=ans[G[i][R[i]]]=1;
    for (int i=1;i<=n;i++)
        cout<<ans[i];
    cout<<'\n';
}
signed main()
{
    IOS;
    cin.tie(0);
    int T=1;
    while (T--)
    {
        BellaKira();
    }
}
/*list:
1.mod 998244353 or 1e9+7 or ???
2.N
3.duipai shuju xingtai duoyidian
...
*/