import java.io.*; import java.util.*; import java.util.function.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); char[][] strings = new char[2][]; for (int i = 0; i < 2; i++) { strings[i] = sc.next().toCharArray(); } Map idxes = Map.of("S", 0, "T", 1); TreeSet diff = IntStream.range(0, n).filter(i -> strings[0][i] != strings[1][i]) .mapToObj(i -> Integer.valueOf(i)).collect(Collectors.toCollection(TreeSet::new)); int q = sc.nextInt(); String result = IntStream.range(0, q).mapToObj(i -> { int x = idxes.get(sc.next()); int positon = sc.nextInt() - 1; char c = (char)(sc.nextInt() + '0'); strings[x][positon] = c; if (strings[0][positon] == strings[1][positon]) { diff.remove(positon); } else { diff.add(positon); } if (diff.size() == 0) { return "="; } else if (strings[0][diff.first()] < strings[1][diff.first()]) { return "<"; } else { return ">"; } }).collect(Collectors.joining("\n")); System.out.println(result); } } class Scanner { BufferedReader br; StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() { try { br = new BufferedReader(new InputStreamReader(System.in)); } catch (Exception e) { } } public int nextInt() { return Integer.parseInt(next()); } public long nextLong() { return Long.parseLong(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String next() { try { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } } catch (Exception e) { e.printStackTrace(); } finally { return st.nextToken(); } } }