class SegTree:
    def __init__(self, init_val, segfunc, ide_ele):
        n = len(init_val)
        self.segfunc = segfunc
        self.ide_ele = ide_ele
        self.num = 1 << (n - 1).bit_length()
        self.tree = [ide_ele] * 2 * self.num
        for i in range(n):
            self.tree[self.num + i] = init_val[i]
        for i in range(self.num - 1, 0, -1):
            self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])
    def update(self, k, x):
        k += self.num
        self.tree[k] = x
        while k > 1:
            self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])
            k >>= 1
    def query(self, l, r):
        res = self.ide_ele
        l += self.num
        r += self.num
        while l < r:
            if l & 1:
                res = self.segfunc(res, self.tree[l])
                l += 1
            if r & 1:
                res = self.segfunc(res, self.tree[r - 1])
            l >>= 1
            r >>= 1
        return res
n=int(input())
s=list(input())
t=list(input())
a=[n+1]*n
b=[n+1]*n
for i in range(n):
    if int(s[i])>int(t[i]):
        a[i]=i
    elif int(s[i])<int(t[i]):
        b[i]=i
def segf(x,y):return min(x,y)
segs=SegTree(a,segf,n+1)
segt=SegTree(b,segf,n+1)
for i in range(int(input())):
    c,x,y=input().split()
    x=int(x)-1
    if c=="S":s[x]=y
    else:t[x]=y
    if s[x]<t[x]:
        segt.update(x,x)
        segs.update(x,n+1)
    elif s[x]==t[x]:
        segt.update(x,n+1)
        segs.update(x,n+1)
    else:
        segt.update(x,n+1)
        segs.update(x,x)
    s1=segs.query(0,n)
    t1=segt.query(0,n)
    if s1<t1:
        print(">")
    elif s1==t1:
        print("=")
    else:
        print("<")