import heapq
class pqheap:
  def __init__(self,key=None):
    self.p = list()
    self.q = list()

  def insert(self,x):
    heapq.heappush(self.p, x)
    return

  def erase(self,x):
    heapq.heappush(self.q, x)
    return

  def minimum(self):
    while self.q and self.p[0] == self.q[0]:
      heapq.heappop(self.p)
      heapq.heappop(self.q)
    return self.p[0] if len(self.p)>0 else None
def main1(n,s,t,sary,tary,query):
  pq=pqheap()
  ret=[]
  for i in range(n):
    if sary[i]!=tary[i]:
      pq.insert(i)
  for tmp in query:
    c,x,y=tmp.split()
    x=int(x)-1
    y=int(y)
    if sary[x]!=tary[x]:
      pq.erase(x)
    if c=="S":
      sary[x]=y
    else:
      tary[x]=y
    if sary[x]!=tary[x]:
      pq.insert(x)
    idx=pq.minimum()
    if idx is None:
      ret.append("=")
    elif sary[idx]<tary[idx]:
      ret.append("<")
    elif sary[idx]>tary[idx]:
      ret.append(">")
    #print(sary,tary,idx)
  return ret

if __name__=='__main__':
  n=int(input())
  s=input()
  sary=list(map(int,list(s)))
  s=int(s)
  t=input()
  tary=list(map(int,list(t)))
  t=int(t)
  q=int(input())
  query=[input() for _ in range(q)]
  ret1=main1(n,s,t,sary[:],tary[:],query[:])
  print(*ret1,sep="\n")