import java.util.Scanner; import java.util.List; import java.util.ArrayList; import java.util.Collections; public class No1439 { private static int[] S, T; private static int N, D; private static boolean A; private static List Diff; public static void main(String[] args) { Scanner scan = new Scanner(System.in); N = scan.nextInt(); String s = scan.next(); String t = scan.next(); int Q = scan.nextInt(); S = new int[N]; T = new int[N]; D = 0; Diff = new ArrayList(); for (int i=0; i < N; i++) { int cs = s.charAt(i) - '0'; int ct = t.charAt(i) - '0'; S[i] = cs; T[i] = ct; if (cs != ct) { if (D == 0) { D = i+1; A = S[i] > T[i]; } else { Diff.add(i+1); } } } for (int i=0; i < Q; i++) { String c = scan.next(); int x = scan.nextInt(); int y = scan.nextInt(); review(c.charAt(0), x, y); if (D == 0) { System.out.println('='); } else if (A) { System.out.println('>'); } else { System.out.println('<'); } } scan.close(); } private static void review(char c, int x, int y) { if (c == 'S') { if (S[x-1] == y) { return; } S[x-1] = y; } else { if (T[x-1] == y) { return; } T[x-1] = y; } if (D == 0 || x < D) { if (D != 0) { Diff.add(0, D); } D = x; A = S[x-1] > T[x-1]; } else if (x == D) { if (S[x-1] != T[x-1]) { D = x; A = S[x-1] > T[x-1]; } else if (Diff.size() > 0) { D = Diff.remove(0); A = S[D-1] > T[D-1]; } else { D = 0; } } else { int i = Collections.binarySearch(Diff, x); if (i < 0) { Diff.add(-i-1, x); } } } }