#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    int n;
    cin >> n;
    deque<char> Q;
    for (int i = 0; i < n; ++i) {
        int t; char s;
        cin >> t >> s;
        if(t) Q.emplace_front(s);
        else Q.emplace_back(s);
    }
    while(!Q.empty()){
        putchar(Q.front());
        Q.pop_front();
    }
    puts("");
    return 0;
}