#include <iostream>
#include <string>
#include <algorithm>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int main() {
	deque<char> que;
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		int b;
		char c;
		cin >> b >> c;
		if (b == 0) {
			que.push_back(c);
		}
		else {
			que.push_front(c);
		}
	}
	while (!que.empty()) {
		cout << que.front();
		que.pop_front();
	}
	cout << endl;
	return 0;
}