#include <bits/stdc++.h>
#define X first
#define Y second
using namespace std;
using ld = double;
typedef long long int ll;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using uint = unsigned int;
const int maxn = 1e6 + 10;
const ll inf = 114514191981052013LL;
const int mod = 1e9 + 7;
int n, p = 0, l[maxn], r[maxn], ans[maxn], q[maxn << 2], hd = 1, tl = 0;
struct Node { int x, y; } c[maxn]; set<int>s[maxn]; vector<int>f[maxn], t;
inline int cmp(int i, int j) { return c[i].x > c[j].x; }
inline void ins(int x) { ans[x] = 1; s[c[x].x].insert(c[x].y); if (s[c[x].x].size() > 2) q[++tl] = c[x].x; }
inline void del(int x) { ans[x] = 0; s[c[x].x].erase(c[x].y); }
int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) scanf("%d%d", &c[i].x, &c[i].y), f[c[i].y].push_back(i);
	for (int i = 1; i < maxn; i++) {
		if (f[i].empty()) continue;
		l[i] = 0, r[i] = f[i].size() - 1;
		sort(f[i].begin(), f[i].end(), cmp); ins(f[i][0]);
		if (f[i].size() > 1) ins(f[i].back());
	}
	while (hd <= tl) {
		int x = q[hd++];
		if (s[x].size() < 3) continue;
		int mi = *s[x].begin(), mx = *--s[x].end(); t.clear();
		for (auto i : s[x]) if (i != mi && i != mx) t.push_back(i);
		for (auto i : t) {
			int u = f[i][l[i]], v = f[i][r[i]];
			if (l[i] == r[i]) del(u), ++l[i];
			else if (x == c[u].x) {
				del(u), ++l[i];
				if (l[i] != r[i]) ins(f[i][l[i]]);
			}
			else if (x == c[v].x) {
				del(u), --r[i];
				if (l[i] != r[i]) ins(f[i][r[i]]);
			}
		}
	}
	for (int i = 1; i <= n; i++) printf("%d", ans[i]); puts("");
	return 0;
}