#include "bits/stdc++.h"
using namespace std;
#ifdef DEBUG
#define dbg(x) cout << (#x) << " = " << (x) << "\n";
#else
#define dbg(x)
#endif

const int N = 1000005;
class BIT {
public:
    int bit[N], n;    
    BIT(int n) : n(n) {memset(bit, 0, sizeof(bit));}
    void update(int p, int x) {
        p++;
        for (; p <= n; p += p & (-p)) {
            bit[p] += x;
        }
    }
    
    int query(int p) {
        p++;
        int res = 0;
        for (; p > 0; p -= p & (-p)) {
            res += bit[p];
        }
        
        return res;
    }
};

typedef long long ll;
typedef pair<int, int> pi;
const int inf = 1e9 + 5;
int n, m, k, qq, h = 0, w = 0;
array<int, 3> a[N];
vector<pi> sweep[N];
int d[N][8], cnt[N];
void add(int p, int x) {
    for (int y = -1; y <= 1; y++) {
        d[p][(x + y + 8) % 8] = 1;
    }    
}

void solvedir(int val) {
    BIT bit(w + 1);
    memset(cnt, 0, sizeof(cnt));
    int c = 0;
    for (int x = 0; x < h; x++) {
        int sz = sweep[x].size();
        for (int i = 0; i < sz; i++) {
            auto [y, p] = sweep[x][i];
            if (i != 0) add(p, 6);
            if (i != sz - 1) add(p, 2);
            int z = bit.query(y - 1);
            if (z) add(p, 7 - val);
            if (cnt[y]) add(p, val * 2);
            if (z + cnt[y] < c) add(p, 1 + val);
            dbg(x);
            dbg(y);
            dbg(p);
            dbg(z);
            dbg(c);
            dbg(cnt[y]);
        }
        
        for (int i = 0; i < sz; i++) {
            auto [y, p] = sweep[x][i];
            bit.update(y, 1);
            cnt[y]++, c++;
        }
    }
}

void solve() {
    cin >> n;
    for (int i = 0; i < n; i++) {
        int x, y;
        cin >> x >> y;
        swap(x, y);
        a[i] = {x, y, i};
    }
    
    sort(a, a + n);
    int pre = a[0][0];
    for (int i = 0; i < n; i++) {
        auto &[x, y, p] = a[i];
        if (x != pre) h++;
        pre = x, x = h;
        swap(x, y);
    }
    
    sort(a, a + n);
    pre = a[0][0];
    for (int i = 0; i < n; i++) {
        auto &[x, y, p] = a[i];
        if (x != pre) w++;
        pre = x, x = w;
        swap(x, y);
    }
    
    sort(a, a + n);
    for (int i = 0; i < n; i++) {
        auto [x, y, p] = a[i];
        sweep[x].push_back({y, p});
    }
    
    h++, w++;
    for (int i = 0; i < h / 2; i++) {
        swap(sweep[i], sweep[h - i - 1]);
    }
    
    solvedir(0);
    for (int i = 0; i < h / 2; i++) {
        swap(sweep[i], sweep[h - i - 1]);
    }
    
    dbg("SPLIT");
    // for (int i = 0; i < n; i++) {
    //     for (int j = 0; j < 8; j++) {
    //         cout << d[i][j];
    //     }
        
    //     cout << "\n";
    // }
    
    solvedir(2);
    for (int i = 0; i < n; i++) {
        int out = 0;
        for (int j = 0; j < 8; j++) {
            // cout << d[i][j];
            if (!d[i][j]) out = 1;
        }
        
        // cout << "\n";
        cout << out;
    }
    
    cout << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    solve();
}