#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

typedef long long ll;

#define MOD 1000000007

int main() {
  int n;
  cin >> n;
  deque<char> que;
  for (int i = 0; i < n; ++i) {
    int t;
    char s;
    cin >> t >> s;
    if (t == 0) {
      que.push_back(s);
    } else {
      que.push_front(s);
    }
  }
  for (int i = 0; i < n; ++i) {
    cout << que.front() << (i == n - 1 ? "\n" : "");
    que.pop_front();
  }
  return 0;
}