import heapq
class Heap_Dict:
    def __init__(self,Mode=True):
        """

        Mode:True→最小値,False→最大値
        """
        self.heap=[]
        self.dict={}
        self.Mode=Mode

    def __bool__(self):
        return bool(self.heap)

    def insert(self,x):
        if self.Mode and not self.is_exist(x):
            heapq.heappush(self.heap,x)
        elif not self.Mode and not self.is_exist(x):
            heapq.heappush(self.heap,-x)

        if x in self.dict:
            self.dict[x]+=1
        else:
            self.dict[x]=1

    def erase(self,x):
        assert (x in self.dict) and (self.dict[x])

        self.dict[x]-=1

        while self.heap:
            y=self.heap[0]
            if not self.Mode:y=-y
            if self.dict[y]==0:
                heapq.heappop(self.heap)
            else:
                break

    def is_exist(self,x):
        return (x in self.dict) and (self.dict[x])

    def get_min(self):
        assert self.Mode

        if self.heap:
            return self.heap[0]
        else:
            return float("inf")

    def get_max(self):
        assert not self.Mode

        if self.heap:
            return -self.heap[0]
        else:
            return -float("inf")

    def count(self,x):
        if x not in self.dict:
            return 0
        else:
            return self.dict[x]
#================================================
import sys
input=sys.stdin.readline
write=sys.stdout.write

N=int(input())
S=list(map(int,input()[:-1]))
T=list(map(int,input()[:-1]))

U=[1 if S[i]!=T[i] else 0 for i in range(N)]
H=Heap_Dict()
H.insert(N)
for i in range(N):
    if U[i]:
        H.insert(i)

Q=int(input())
X=[0]*Q
for i in range(Q):
    c,x,y=input().split()
    x=int(x);y=int(y)

    if c=="S":
        S[x-1]=y
    else:
        T[x-1]=y

    z=1 if S[x-1]!=T[x-1] else 0

    if z==1 and U[x-1]==0:
        U[x-1]=1
        H.insert(x-1)
    if z==0 and U[x-1]==1:
        U[x-1]=0
        H.erase(x-1)

    index=H.get_min()

    if index<N:
        if S[index]>T[index]:
            X[i]=0
        else:
            X[i]=1
    else:
        X[i]=2


def g(x):
    if x==0:
        return ">"
    elif x==1:
        return "<"
    else:
        return "="

write("\n".join(map(g,X)))