from heapq import *
N = int(input())
S = list(str(input()))
T = list(str(input()))
Q = int(input())
A = []
for i in range(N):
    if S[i] != T[i]:
        heappush(A,i)

for _ in range(Q):
    c,x,y = map(str,input().split())
    x = int(x)-1
    if c == 'T':
        T[x] = y
    else:
        S[x] = y
    if S[x] != T[x]:
        if x not in A:
            heappush(A,x)
    else:
        if x in A:
            A.remove(x)
    if A == []:
        print('=')
        continue
    
    a = heappop(A)
    heappush(A,a)

    if S[a] > T[a]:
        print('>')
    elif S[a] < T[a]:
        print('<')
    else:
        print('=')