#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
#define Pool(i, m, n) for (ll i = n; i >= m; i--)
#define setbit bitset<8>
#define flagcount __builtin_popcount
#define flag(x) (1 << x)
#define flagadd(bit, x) bit |= flag(x)
#define flagpop(bit, x) bit &= ~flag(x)
#define flagon(bit, i) bit &flag(i)
#define flagoff(bit, i) !(bit & (1 << i))
#define all(v) v.begin(), v.end()
#define low2way(v, x) lower_bound(all(v), x)
#define high2way(v, x) upper_bound(all(v), x)
#define count2way(v, x) high2way(v, x) - low2way(v, x)
#define lower(v, x) low2way(v, x) - v.begin()       //1番左が0、もし見つから無いならｎを出力
#define higher(v, x) high2way(v, x) - v.begin() - 1 //1番左が0、もし見つからないならn-1を出力（注意）
#define putout(a) cout << a << endl
#define putout2(a, b) \
    putout(a);        \
    putout(b)
#define putout3(a, b, c) \
    putout(a);           \
    putout(b);           \
    putout(c)
#define putout4(a, b, c, d) \
    putout(a);              \
    putout(b);              \
    putout(c);              \
    putout(d)
#define putout5(a, b, c, d, e) \
    putout(a);                 \
    putout(b);                 \
    putout(c);                 \
    putout(d);                 \
    putout(e)
#define Gput(a, b) G[a].push_back(b)
#define cin1(a) cin >> a
#define cin2(a, b) cin >> a >> b
#define cin3(a, b, c) cin >> a >> b >> c
#define cin4(a, b, c, d) cin >> a >> b >> c >> d
#define cin5(a, b, c, d, e) cin >> a >> b >> c >> d >> e
#define sum(v) accumulate(all(v), 0ll)
#define gcd(x, y) __gcd(x, y)
#define erase(s) s.erase(s.end() - 1) //文字列sの末尾削除
long long modinv(long long a, long long m)
{
    long long b = m, u = 1, v = 0;
    while (b)
    {
        long long t = a / b;
        a -= t * b;
        swap(a, b);
        u -= t * v;
        swap(u, v);
    }
    u %= m;
    if (u < 0)
        u += m;
    return u;
}
ll ctoi(char c)
{
    if (c >= '0' && c <= '9')
    {
        return c - '0';
    }
    return 0;
}
long long modpow(long long a, long long n, long long mod)
{
    long long res = 1;
    while (n > 0)
    {
        if (n & 1)
            res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}
ll lcm(ll x, ll y)
{
    ll z = gcd(x, y);
    return x * y / z;
}
ll primejudge(ll n)
{
    if (n < 2)
        return 0;
    else if (n == 2)
        return 1;
    else if (n % 2 == 0)
        return 0;
    double sqrtn = sqrt(n);
    Loop(i, 3, sqrtn + 1)
    {
        if (n % i == 0)
        {
            return 0;
        }
        i++;
    }
    return 1;
}
string RLE(string s)
{
    ll n = s.size();
    char now = '.';
    ll count = 1;
    string press;
    loop(i, n)
    {
        if (s[i] != now)
        {
            if (i)
            {
                press += now;
                press += to_string(count);
            }
            now = s[i];
            count = 1;
            continue;
        }
        else
            count++;
    }
    press += now;
    press += to_string(count);
    return press;
}
int main()
{
    cout << fixed << setprecision(30);
    string s;
    cin >> s;
    ll q;
    cin >> q;
    string cf = "", ce = "";
    ll revcount = 0;
    loop(i, q)
    {
        ll a;
        cin >> a;
        if (a == 1)
            revcount++;
        else
        {
            ll b;
            cin >> b;
            string w;
            cin >> w;
            if ((revcount + b) % 2 == 0)
            {
                ce += w;
            }
            else
            {
                cf += w;
            }
        }
    }
    reverse(all(cf));
    s = cf + s + ce;
    if (revcount % 2 == 1)
    {
        reverse(all(s));
    }
    putout(s);
}


Measured memory_bytes: 1348