import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const S = readToken();
      const T = readToken();
      const Q = readInt();
      auto C = new char[Q];
      auto X = new int[Q];
      auto Y = new char[Q];
      foreach (q; 0 .. Q) {
        C[q] = readToken()[0];
        X[q] = readInt() - 1;
        Y[q] = readToken()[0];
      }
      debug {
        writeln("S = ", S);
        writeln("T = ", T);
      }
      
      auto ss = S.dup;
      auto ts = T.dup;
      alias Entry = Tuple!(int, "pos", char, "cmp");
      auto set = new RedBlackTree!Entry;
      foreach (i; 0 .. N) {
        if (ss[i] != ts[i]) {
          set.insert(Entry(i, (ss[i] < ts[i]) ? '<' : '>'));
        }
      }
      set.insert(Entry(N, '='));
      
      foreach (q; 0 .. Q) {
        const i = X[q];
        if (ss[i] != ts[i]) {
          set.removeKey(Entry(i, (ss[i] < ts[i]) ? '<' : '>'));
        }
        ((C[q] == 'S') ? ss : ts)[i] = Y[q];
        if (ss[i] != ts[i]) {
          set.insert(Entry(i, (ss[i] < ts[i]) ? '<' : '>'));
        }
        writeln(set.front.cmp);
      }
    }
  } catch (EOFException e) {
  }
}