import sys
readline = sys.stdin.readline

class Fenwick_Tree:
    def __init__(self, n):
        self._n = n
        self.data = [0] * n

    def add(self, p, x):
        assert 0 <= p < self._n
        p += 1
        while p <= self._n:
            self.data[p - 1] += x
            p += p & -p

    def sum(self, l, r):
        assert 0 <= l <= r <= self._n
        return self._sum(r) - self._sum(l)

    def _sum(self, r):
        s = 0
        while r > 0:
            s += self.data[r - 1]
            r -= r & -r
        return s
    
    def get(self, k):
        k += 1
        x, r = 0, 1
        while r < self._n:
            r <<= 1
        len = r
        while len:
            if x + len - 1 < self._n:
                if self.data[x + len - 1] < k:
                    k -= self.data[x + len - 1]
                    x += len
            len >>= 1
        return x
    
    
N = int(readline())
S = list(input().rstrip())
T = list(input().rstrip())
S = list(map(int, S))
T = list(map(int, T))
Q = int(readline())

BIT = Fenwick_Tree(N)
for i in range(N):
    BIT.add(i, int(S[i] == T[i]))

for _ in range(Q):
    c, x, y = readline().split()
    x = int(x) - 1
    y = int(y)
    BIT.add(x, -int(S[x] == T[x]))
    if c == "S":
        S[x] = y
    else:
        T[x] = y
    BIT.add(x, int(S[x] == T[x]))
    
    yes = 0
    no = N + 1
    while no - yes != 1:
        mid = (yes + no)//2
        if BIT.sum(0, mid) == mid:
            yes = mid
        else:
            no = mid
    if yes == N:
        print("=")
    elif S[yes] > T[yes]:
        print(">")
    else:
        print("<")