class BIT: #0-indexed
    __slots__ = ["size", "tree","depth","n0"]
    def __init__(self, n):
        self.size = n
        self.tree = [0]*(n+1)
        self.depth = n.bit_length()
        self.n0 = 1<<self.depth

    def get_sum(self, i): #a_0 + ... + a_{i} #閉区間
        s = 0; i += 1
        while i > 0:
            s += self.tree[i]
            i -= i & -i
        return s

    def range_sum(self,l,r): #a_l + ... + a_r 閉区間
        return self.get_sum(r) - self.get_sum(l-1) 

    def range_sum_larger(self,l): #a_l + ... (端まで)
        return self.get_sum(self.size-1) - (self.get_sum(l-1) if l else 0)
    
    def add(self, i, x):
        i += 1
        while i <= self.size:
            self.tree[i] += x
            i += i & -i

    def bisect_left(self,w):
        #和が w 以上になる最小の index
        #w が存在しない場合 self.size を返す
        if w <= 0: return 0
        x,k = 0,self.n0
        for _ in range(self.depth):
            k >>= 1
            if x+k <= self.size and self.tree[x+k] < w:
                w -= self.tree[x+k]
                x += k
        return x

n = int(input())
*s, = map(int,input())
*t, = map(int,input())
s.append(0)
t.append(0)

bit = BIT(n)
for i in range(n):
    if s[i] != t[i]: bit.add(i,1)

Q = int(input())
for _ in range(Q):
    c,x,y = input().split()
    i = int(x)-1
    y = int(y)
    eq = s[i]!=t[i]
    if c=="S":
        s[i] = y
    else:
        t[i] = y
    af = s[i]!=t[i]
    if eq != af:
        bit.add(i,af-eq)
    
    i = bit.bisect_left(1)
    if s[i] > t[i]:
        print(">")
    elif s[i] < t[i]:
        print("<")
    else:
        print("=")