#include <bits/stdc++.h>
// #pragma GCC optimize(2)
#define int long long
#define pii pair<int, int>
#define tpi tuple<int, int, int, int>
#define il inline
#define p_q priority_queue
#define u_m unordered_map
#define bt bitset
#define rg register

using namespace std;

const int N1 = 300005;
const int N2 = 1000006;
const int mod = 998244353;

using i64 = long long;

void chmin(int& x, int c) {
	x = min(x, c);
}
void chmax(int& x, int c) {
	x = max(x, c);
}

#define debug 1
// #define multi_test_ 1
#define endl '\n'

int _test_ = 1;

namespace zqh {
	int n;
	pii a[1000005];
	vector<int> p;

	void dfs(int u) {
		if (u == n + 1) {
			u_m<int, int> xx, yy;
			for (int x : p) {
				xx[a[x].first]++;
				if (xx[a[x].first] > 2) return;
				yy[a[x].second]++;
				if (yy[a[x].second] > 2) return;
			}
			for (int i = 1; i <= n; i++) {
				bool flag = false;
				for (int x : p) {
					for (int y : p) {
						if (x == y || a[x].first != a[x].first) continue;
						if (i == x || i == y) {
							flag = true;
							continue;
						}
						if (a[x].first != a[i].first) continue;
						if (a[y].first != a[i].first) continue;
						if (a[x].first <= a[i].first && a[i].first <= a[y].first) {
							flag = true;
							continue;
						}
						if (a[y].first <= a[i].first && a[i].first <= a[x].first) {
							flag = true;
							continue;
						}
						return;
					}
				}
				if (!flag) return;
			}
			for (int i = 1; i <= n; i++) {
				bool flag = false;
				for (int x : p) {
					for (int y : p) {
						if (x == y || a[x].second != a[x].second) continue;
						if (i == x || i == y) {
							flag = true;
							continue;
						}
						if (a[x].second != a[i].second) continue;
						if (a[y].second != a[i].second) continue;
						if (a[x].second <= a[i].second && a[i].second <= a[y].second) {
							flag = true;
							continue;
						}
						if (a[y].second <= a[i].second && a[i].second <= a[x].second) {
							flag = true;
							continue;
						}
						return;
					}
				}
				if (!flag) return;
			}
			string s = "";
			for (int i = 1; i <= n; i++) {
				s.push_back('0');
			}
			for (int x : p) {
				s[x - 1] = '1';
			}
			cout << s;
			exit(0);
		}
		dfs(u + 1);
		p.push_back(u);
		dfs(u + 1);
		p.pop_back();
	}

	void init() {
		cin >> n;
		for (int i = 1; i <= n; i++) {
			cin >> a[i].first >> a[i].second;
		}
	}

	void solve() {
		dfs(1);
		cout << "-1";
	}

	void main() {
		init();
		solve();
	}
}  // namespace zqh

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
#ifdef debug
#endif
#ifdef multi_test_
	cin >> _test_;
#endif
	while (_test_--) {
		zqh::main();
	}
	return 0;
}
/*

*/