#include <bits/stdc++.h>

using namespace std;

int n, vis[30];
char tre[205];

void dfs(int k)
{
    cout << tre[k];
    if(tre[k * 2] != '*')
    {
        dfs(k * 2);
    }
    if(tre[k * 2 + 1] != '*')
    {
        dfs(k * 2 + 1);
    }
}

int main()
{
    cin >> n;
    memset(tre, ' ', sizeof tre);
    for(int i = 1; i <= n; i++)
    {
        char c, l, r;
        cin >> c >> l >> r;
        if(i == 1)
        {
            tre[i] = c;
        }
        tre[2 * i] = l;
        tre[2 * i + 1] = r;
    }
    dfs(1);

    return 0;
}