using System;
using System.Collections;
using System.Collections.Generic;
using System.Collections.Specialized;
using System.Linq;
using System.Numerics;
using System.Text;

namespace AtCoderWorkspace
{
    public class Solver
    {
        public void Solve()
        {
            var cin = new Scanner();
            var s = cin.next();
            var q = cin.nextInt();
            var list = new List<Tuple<int, int, char>>();
            for (int i = 0; i < q; i++)
            {
                var qq = cin.nextInt();
                if (qq == 1)
                {
                    list.Add(Tuple.Create(qq, 0, 'a'));
                }
                else
                {
                    var f = cin.nextInt();
                    var c = cin.next();
                    list.Add(Tuple.Create(qq, f, c.ToCharArray()[0]));
                }
            }

            var inv = false;
            var link = new LinkedList<char>();
            foreach (var item in s.ToCharArray())
            {
                link.AddLast(item);
            }            
            foreach (var item in list)
            {
                var qq = item.Item1;
                if (qq == 1)
                {
                    inv = !inv;
                }
                else
                {
                    var f = item.Item2;
                    var c = item.Item3;
                    if (f == 1)
                    {
                        // first
                        if (inv)
                        {
                            // last
                            link.AddLast(c);
                        }
                        else
                        {
                            // first
                            link.AddFirst(c);
                        }
                    }
                    else
                    {
                        // last
                        if (inv)
                        {
                            // first
                            link.AddFirst(c);
                        }
                        else
                        {
                            // last                            
                            link.AddLast(c);
                        }
                    }
                }
            }

            List<char> l;
            if (inv) l = link.Reverse().ToList();
            else l = link.ToList();
            StringBuilder sb = new StringBuilder();
            foreach (var item in l)
            {
                sb.Append(item.ToString());
            }
            Console.WriteLine(sb.ToString());
        }
    }

    class Scanner
    {
        string[] s;
        int i;

        char[] cs = new char[] { ' ' };

        public Scanner()
        {
            s = new string[0];
            i = 0;
        }

        public string next()
        {
            if (i < s.Length) return s[i++];
            string st = Console.ReadLine();
            while (st == "") st = Console.ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            if (s.Length == 0) return next();
            i = 0;
            return s[i++];
        }

        public int nextInt()
        {
            return int.Parse(next());
        }
        public int[] ArrayInt(int N, int add = 0)
        {
            int[] Array = new int[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextInt() + add;
            }
            return Array;
        }

        public int[] DPArrayInt(int N, int ex)
        {
            int[] Array = new int[N + ex];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextInt();
            }
            return Array;
        }

        public long nextLong()
        {
            return long.Parse(next());
        }

        public long[] ArrayLong(int N, long add = 0)
        {
            long[] Array = new long[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextLong() + add;
            }
            return Array;
        }

        public long[] DPArrayLong(int N, int ex)
        {
            long[] Array = new long[N + ex];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextLong();
            }
            return Array;
        }

        public double nextDouble()
        {
            return double.Parse(next());
        }


        public double[] ArrayDouble(int N, double add = 0)
        {
            double[] Array = new double[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextDouble() + add;
            }
            return Array;
        }
    }

    class Program
    {
        static void Main(string[] s) => new Solver().Solve();
    }
}


Measured memory_bytes: 45184