ABC199 C - IPFL이 풀렸다.

n = int(input())
S = input()
front = list(S[:n])
rear  = list(S[n:])
Q = int(input())

for _ in range(Q):
    t,a,b = map(int,input().split())
    if t == 1:
        if a <= n and b <= n:
            front[a-1], front[b-1] = front[b-1], front[a-1]# <= ココ 1
        elif a <= n and b > n:
            front[a-1],rear[b-n-1] = rear[b-n-1],front[a-1]
        elif a > n and b > n:
            rear[a-n-1],rear[b-n-1] = rear[b-n-1], rear[a-n-1] # <= ココ 2 
    else:
        front,rear = rear,front
        #print(front, rear)

print("".join(front+rear))