#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,nso-stack-protector,unroll-loops,fast-math,-O3")
#define F first
#define S second
#define pb push_back
#define N +1000500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
#define Max_A int(1e9)
//#define el endl
#define pii pair <int, int>
#define psi pair <string, int>
#define err ld(1e-9)
#define Max_S int(3e6)
#define last(x) x.back()
#define all(x) (x).begin(), (x).end()
#define arr_all(x, n) (x + 1), (x + 1 + n)
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;
pair <pair <int, int>, pair <int, int> > f[N];
int i, n;
psi umax(psi a, psi b)
{
if (sz(a.F) + a.S > sz(b.F) + b.S) return a;
if (sz(a.F) + a.S < sz(b.F) + b.S) return b;
string na = a.F, nb = b.F;
while (sz(na) < sz(nb)) na += "0";
while (sz(na) > sz(nb)) nb += "0";
int i = 0;
while (i < sz(na) && na[i] == nb[i]) i++;
if (i == sz(na)) return a;
if (na[i] > nb[i]) return a;
else return b;
}
psi upd(psi x)
{
x.S++;
return x;
}
string bin(ll x)
{
string ans = "";
while (x)
{
if (x & 1)
ans += "1";
else ans += "0";
//ans += char('0' + x & 1);
x >>= 1;
}
reverse(all(ans));
return ans;
}
psi rec(ll v)
{
psi lF = {bin(f[v].F.F), 0};
psi rF = {bin(f[v].F.S), 0};
if (f[v].S.F != 0) lF = rec(f[v].S.F);
if (f[v].S.S != 0) rF = rec(f[v].S.S);
return upd(umax(lF, rF));
}
string restore(psi x)
{
string ans = x.F;
for (int i = 0; i < x.S; i++) ans += "0";
return ans;
}
int main()
{
cout.precision(2);
srand(time(0));
ios_base::sync_with_stdio(0);
iostream::sync_with_stdio(0);
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
// in("input.txt");
// out("output.txt");
cin >> n;
for (i = 1; i <= n; i++)
{
int l, r;
cin >> l >> r;
if (l > 0) f[i].S.F = l; else f[i].F.F = -l;
if (r > 0) f[i].S.S = r; else f[i].F.S = -r;
}
cout << restore(rec(1)) << el;
}
//
//00000
//00110
//00111
//00011
//00000
