#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(n) begin(n), end(n)
using ll = long long;
using namespace std;

int main(){
	int n;
	cin >> n;
	deque<char> dq;
	rep(i, n){
		int t;
		char c;
		cin >> t >> c;
		if(t == 0) dq.push_back(c);
		else dq.push_front(c);
	}
	while(!dq.empty()){
		cout << dq.front();
		dq.pop_front();
	}
	cout << endl;
	return 0;
}