#include <stdio.h>
#include <algorithm>
#include <vector>
#include <iostream>
const int N = 1e6 + 5;
int n;
int L[N], R[N];
void convert(std::vector<char> &res, int x)
{
for (; x; x /= 2)
res.push_back(x % 2 ? '1' : '0');
std::reverse(res.begin(), res.end());
}
std::vector<char> dfs(int v)
{
std::vector<char> a, b;
if (L[v] < 0)
a = dfs(-L[v]);
else
convert(a, L[v]);
if (R[v] < 0)
b = dfs(-R[v]);
else
convert(b, R[v]);
if (a.size() < b.size())
swap(a, b);
if (a.size() != b.size())
return a.push_back('0'), a;
for (int i = 0, k = a.size(); i < k; i++)
if (a[i] != b[i])
{
if (b[i] == '1')
std::swap(a, b);
break;
}
return a.push_back('0'), a;
}
int main()
{
std::ios_base::sync_with_stdio(0);
std::istream::sync_with_stdio(0);
std::cin.tie(0); std::cout.tie(0);
std::cin >> n;
for (int i = 1; i <= n; i++)
{
std::cin >> L[i] >> R[i];
L[i] = -L[i], R[i] = -R[i];
}
std::vector<char> ans = dfs(1);
for (auto x : ans)
std::cout << x;
return 0;
}
