#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,N) for(int i=0;i<int(N);++i)
#define rep1(i,N) for(int i=1;i<int(N);++i)
#define all(a) (a).begin(),(a).end()
#define bit(k) (1LL<<(k))
#define SUM(v) accumulate(all(v), 0LL)

typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
struct fast_ios{ fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; }fast_ios_;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

#define TOSTRING(x) string(#x)
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (T &x : vec) is >> x; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { os  << "["; for(auto _: v) os << _ << ", "; os << "]"; return os; };
template <typename T> ostream &operator<<(ostream &os, set<T> &st) { os << "("; for(auto _: st) { os << _ << ", "; } os << ")";return os;}
template <typename T> ostream &operator<<(ostream &os, multiset<T> &st) { os << "("; for(auto _: st) { os << _ << ", "; } os << ")";return os;}
template <typename T, typename U> ostream &operator<<(ostream &os, const pair< T, U >& p){os << "{" <<p.first << ", " << p.second << "}";return os; }
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &mp){ os << "["; for(auto _: mp){ os << _ << ", "; } os << "]" << endl; return os; }

#define DUMPOUT cerr
void dump_func(){ DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) { DUMPOUT << head; if (sizeof...(Tail) > 0) { DUMPOUT << ", "; } dump_func(std::move(tail)...); }

#ifdef DEBUG
#define dbg(...) { dump_func(__VA_ARGS__) }
#define dump(...) DUMPOUT << string(#__VA_ARGS__) << ": "; dump_func(__VA_ARGS__)
#else
#define dbg(...)
#define dump(...)
#endif

const int INF = (ll)1e9;
const ll INFLL = (ll)1e18+1;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
const long double PI = acos(-1.0);

/*
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const string dir = "DRUL";
*/


int main() {
    int N;
    cin >> N;
    string S;
    cin >> S;
    string X, Y;
    X = S.substr(0, N);
    Y = S.substr(N,N);
    dump(X, Y);
    int Q;
    cin >> Q;
    while(Q--){
        int t, a, b;
        cin >> t >> a >> b;
        a--, b--;
        dump(Q);
        if(t == 1){
            if(a < N){
                if(b < N){
                    swap(X[a], X[b]);
                }
                else{
                    swap(X[a], Y[b-N]);
                }
            }else{
                if(b < N){
                    swap(Y[a-N], X[b]);
                }else{
                    swap(Y[a-N], Y[b-N]);
                }
            }
        }
        else{
            swap(X, Y);
        }
        dump(X, Y);
    }
    cout << X << Y << endl;
}

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    string s;
    int q;
    cin >> n >> s >> q;
    int flipcount = 0;
    for (int i = 0; i < q; i++) {
        int t, a, b;
        cin >> t >> a >> b;
        if (t == 1) {
            a--;
            b--;
            if (flipcount % 2 == 1) {
                if (a < n) {
                    a += n;
                } else {
                    a -= n;
                }
                if (b < n) {
                    b += n;
                } else {
                    b -= n;
                }
            }
            char c;
            c = s[a];
            s[a] = s[b];
            s[b] = c;
        } else {
            flipcount++;
        }
    }
    if (flipcount % 2 == 1) {
        string t;
        t = s.substr(n);
        s.erase(n);
        s.insert(0, t);
    }
    cout << s << endl;
}