import java.io.PrintWriter;
import java.util.Scanner;
import java.util.TreeSet;

public class P5533 {
	static Scanner in = new Scanner(System.in);
	static PrintWriter out = new PrintWriter(System.out);

	public static void main(String[] args) {
		int n = ni();
		if(!(1 <= n && n <= 200000))throw new IllegalArgumentException("n");
		char[] s = in.next().toCharArray();
		char[] t = in.next().toCharArray();
		if(s.length != n)throw new IllegalArgumentException("len of s");
		if(t.length != n)throw new IllegalArgumentException("len of t");
		for(int i = 0;i < n;i++){
			if(!('0' <= s[i] && s[i] <= '9'))throw new IllegalArgumentException("s");
			if(!('0' <= t[i] && t[i] <= '9'))throw new IllegalArgumentException("t");
		}

		TreeSet<Integer> sg = new TreeSet<>();
		TreeSet<Integer> tg = new TreeSet<>();
		for(int i = 0;i < n;i++){
			if(s[i] > t[i]){
				sg.add(i);
			}else if(s[i] < t[i]){
				tg.add(i);
			}
		}
		int Q = ni();
		if(!(1 <= Q && Q <= 200000))throw new IllegalArgumentException("Q");

		for(;Q > 0;Q--){
			String cs = in.next();
			if(cs.length() != 1)throw new IllegalArgumentException("|c| != 1");
			char c = cs.charAt(0);
			if(!(c == 'S' || c == 'T'))throw new IllegalArgumentException("c");
			int k = ni()-1;
			if(!(0 <= k && k < n))throw new IllegalArgumentException("k");
			int v = ni();
			if(!(0 <= v && v <= 9))throw new IllegalArgumentException("v");
			if(c == 'S'){
				s[k] = (char)('0'+v);
			}else{
				t[k] = (char)('0'+v);
			}
			sg.remove(k);
			tg.remove(k);
			if(s[k] > t[k]){
				sg.add(k);
			}else if(s[k] < t[k]){
				tg.add(k);
			}

			int mins = sg.isEmpty() ? n + 1 : sg.first();
			int mint = tg.isEmpty() ? n + 1 : tg.first();
			if(mins == mint){
				out.println("=");
			}else if(mins < mint) {
				out.println(">");
			}else{
				out.println("<");
			}
		}
		out.flush();
	}

	static int ni(){ return Integer.parseInt(in.next()); }
}