output_description: Print the resulting string.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      S
      Q
      Query_1
      :
      Query_Q
      
  
  In the 3-rd through the (Q+2)-th lines, Query_i is one of the following:
  
      
      
      1
      
  
  which means T_i = 1, and:
  
      
      
      2 F_i C_i
      
  
  which means T_i = 2.
attempt: print("xy")
  
problem_description: Statement
  
  Takahashi has a string S consisting of lowercase English letters.
  
  Starting with this string, he will produce a new one in the procedure given as
  follows.
  
  The procedure consists of Q operations. In Operation i (1 \leq i \leq Q), an
  integer T_i is provided, which means the following:
  
    * If T_i = 1: reverse the string S.
  
    * If T_i = 2: An integer F_i and a lowercase English letter C_i are additionally provided.
  
      * If F_i = 1 : Add C_i to the beginning of the string S.
      * If F_i = 2 : Add C_i to the end of the string S.
  
  Help Takahashi by finding the final string that results from the procedure.
samples: [{"input": "a\n    4\n    2 1 p\n    1\n    2 2 c\n    1", "output": "cpa\n    \n\nThere will be Q = 4 operations. Initially, S is `a`.\n\n  * Operation 1: Add `p` at the beginning of S. S becomes `pa`.\n\n  * Operation 2: Reverse S. S becomes `ap`.\n\n  * Operation 3: Add `c` at the end of S. S becomes `apc`.\n\n  * Operation 4: Reverse S. S becomes `cpa`.\n\nThus, the resulting string is `cpa`.\n\n* * *"}, {"input": "a\n    6\n    2 2 a\n    2 1 b\n    1\n    2 2 c\n    1\n    1", "output": "aabc\n    \n\nThere will be Q = 6 operations. Initially, S is `a`.\n\n  * Operation 1: S becomes `aa`.\n\n  * Operation 2: S becomes `baa`.\n\n  * Operation 3: S becomes `aab`.\n\n  * Operation 4: S becomes `aabc`.\n\n  * Operation 5: S becomes `cbaa`.\n\n  * Operation 6: S becomes `aabc`.\n\nThus, the resulting string is `aabc`.\n\n* * *"}, {"input": "y\n    1\n    2 1 x", "output": "xy"}]