import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container, std.format;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    auto S = sread();
    long Q = lread();
    DList!char ans;
    foreach (c; S)
        ans.insertBack(c);
    bool reverse;
    foreach (i; 0 .. Q)
    {
        auto input = readln().split();
        if (input[0] == "1")
        {
            reverse = (reverse == false);
            continue;
        }
        if (input[0] == "2")
        {
            bool front = (input[1] == "1" && !reverse) || (input[1] == "2" && reverse);
            if (front)
            {
                ans.insertFront(input[2][0]);
            }
            else
            {
                ans.insertBack(input[2][0]);
            }
        }
    }
    if (!reverse)
    {
        foreach (c; ans)
            write(c);
    }
    else
    {
        foreach_reverse (c; ans)
            write(c);
    }
    writeln();
}
