import heapq
N=int(input())
S=list(input())
T=list(input())
Q=int(input())
s,q=set(),[]
for i in range(N):
    if S[i]!=T[i]:
        q.append(i)
        s.add(i)
heapq.heapify(q)
for i in range(Q):
    c,x,y=input().split()
    x=int(x)-1
    if c=="T":
        T[x]=y
    else:
        S[x]=y
    if S[x]!=T[x]:
        heapq.heappush(q,x)
    while len(q)!=0:
        num=heapq.heappop(q)
        if int(S[num])>int(T[num]):
            print(">")
            heapq.heappush(q,num)
            break
        elif int(S[num])<int(T[num]):
            print("<")
            heapq.heappush(q,num)
            break
    if len(q)==0:
        print("=")