#include <cstdio>
#include <algorithm>
int main(){
    int N,T,p=0;
    char ans0[200000+1],ans1[200000+1],S; 
    scanf("%d",&N);
    for(int i=0;i<N;i++){
        scanf("%d %c",&T,&S);
        if(T==0){
            ans0[p++]=S;
        }else ans1[i-p]=S;
    }
    ans0[p]='\0';
    ans1[N-p]='\0';
    std::reverse(ans1,ans1+N-p);
    printf("%s%s\n",ans1,ans0);
    return 0;
}