#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define pf push_front
#define N 1000010
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9
using namespace std;
//using namespace __gnu_pbds;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef short int si;
typedef array <int, 6> a6;
//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
int L[N], R[N];
vector <char> tranc(int x)
{
vector <char> gr; gr.clear();
while (x > 0)
{
if (x % 2) gr.pb('1');
else gr.pb('0');
x /= 2;
}
reverse(gr.begin(), gr.end());
return gr;
}
pair <int, int > dfs(int v)
{
pair <int, int> l, r;
if (L[v] < 0) l = dfs(abs(L[v])); else l = {0, L[v]};
if (R[v] < 0) r = dfs(abs(R[v])); else r = {0, R[v]};
if (log2(l.S) + l.F < log2(r.S) + r.F) swap(l, r);
if (log2(l.S) + l.F != log2(r.S) + r.F) {l.F++; return l;}
vector <char> gl = tranc(l.S);
vector <char> gr = tranc(r.S);
for (int i = 0; i < min(sz(gr), sz(gl)); i++)
{
if (gl[i] == gr[i]) continue;
if (gr[i] == '1') swap(l, r);
break;
}
l.F++;
return l;
}
int main()
{
//freopen("input.txt", "r", stdin); freopen("output4.txt", "w", stdout);
ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++)
{
int l, r;
cin >> l >> r;
if (l < 0) L[i] = abs(l); else L[i] = -l;
if (r < 0) R[i] = abs(r); else R[i] = -r;
}
pair <int, int > gr = dfs(1);
vector <char> pr = tranc(gr.S);
for (int i = 0; i < gr.F; i++) pr.pb('0');
for (auto it : pr) cout << it;
}
