import java.util.*; import java.io.*; import java.math.*;
public class Main{
    //Don't have to see. start------------------------------------------
    static class InputIterator{
        ArrayList<String> inputLine = new ArrayList<>(1024);
        int index = 0; int max; String read;
        InputIterator(){
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            try{
                while((read = br.readLine()) != null){
                    inputLine.addAll(Arrays.asList(read.split(" ")));
                }
            }catch(IOException e){}
            max = inputLine.size();
        }
        boolean hasNext(){return (index < max);}
        String next(){
            if(hasNext()){
                return inputLine.get(index++);
            }else{
                throw new IndexOutOfBoundsException("There is no more input");
            }
        }
    }
    static HashMap<Integer, String> CONVSTR = new HashMap<>();
    static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem.
    static PrintWriter out = new PrintWriter(System.out);
    static void flush(){out.flush();}
    static void myout(Object t){out.println(t);}
    static void myerr(Object t){System.err.print("debug:");System.err.println(t);}
    static String next(){return ii.next();}
    static boolean hasNext(){return ii.hasNext();}
    static int nextInt(){return Integer.parseInt(next());}
    static long nextLong(){return Long.parseLong(next());}
    static double nextDouble(){return Double.parseDouble(next());}
    static ArrayList<String> nextCharArray(){return myconv(next(), 0);}
    static ArrayList<String> nextStrArray(int size){
        ArrayList<String> ret = new ArrayList<>(size);
        for(int i = 0; i < size; i++){
            ret.add(next());
        }
        return ret;
    }
    static ArrayList<Integer> nextIntArray(int size){
        ArrayList<Integer> ret = new ArrayList<>(size);
        for(int i = 0; i < size; i++){
            ret.add(Integer.parseInt(next()));
        }
        return ret;
    }
    static ArrayList<Long> nextLongArray(int size){
        ArrayList<Long> ret = new ArrayList<>(size);
        for(int i = 0; i < size; i++){
            ret.add(Long.parseLong(next()));
        }
        return ret;
    }
    @SuppressWarnings("unchecked")
    static String myconv(Object list, int no){//only join
        String joinString = CONVSTR.get(no);
        if(list instanceof String[]){
            return String.join(joinString, (String[])list);
        }else if(list instanceof ArrayList){
            return String.join(joinString, (ArrayList)list);
        }else{
            throw new ClassCastException("Don't join");
        }
    }
    static ArrayList<String> myconv(String str, int no){//only split
        String splitString = CONVSTR.get(no);
        return new ArrayList<String>(Arrays.asList(str.split(splitString)));
    }
    public static void main(String[] args){
        CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, "");
        solve();flush();
    }
    //Don't have to see. end------------------------------------------
    static void solve(){//Here is the main function
        int N = nextInt();
        int[] S = new int[N];
        int[] T = new int[N];
        String tmpS = next();
        String tmpT = next();
        TreeSet<Integer> set = new TreeSet<>();
        for(int i = 0; i < N; i++){
            S[i] = tmpS.charAt(i) - '0';
            T[i] = tmpT.charAt(i) - '0';
            if(S[i] != T[i]){
                set.add(i);
            }
        }
        int index = 0;
        String b = "=";
        for(int i = 0; i < N; i++){
            if(S[i] != T[i]){
                index = i;
                if(S[i] > T[i]){
                    b = ">";
                }else{
                    b = "<";
                }
                break;
            }
        }
        if(b == "="){
            index = N - 1;
        }
        int Q = nextInt();
        for(int i = 0; i < Q; i++){
            String ci = next();
            int xi = nextInt() - 1;
            int yi = nextInt();
            if(ci.equals("S")){
                if(S[xi] == yi){
                    myout(b);
                    continue;
                }else{
                    S[xi] = yi;
                }
            }else{
                if(T[xi] == yi){
                    myout(b);
                    continue;
                }else{
                    T[xi] = yi;
                }
            }
            if(S[xi] == T[xi]){
                set.remove(xi);
            }else{
                set.add(xi);
            }
            if(xi == index){
                if(S[xi] > T[xi]){
                    b = ">";
                }else if(S[xi] < T[xi]){
                    b = "<";
                }else{
                    b = "=";
                    Object nextIndex = set.higher(index);
                    if(nextIndex == null){
                        index = N - 1;
                    }else{
                        index = (int)nextIndex;
                        if(S[index] > T[index]){
                            b = ">";
                        }else{
                            b = "<";
                        }
                    }
                }
                myout(b);
                continue;
            }
            if(index < xi){
                myout(b);
            }else{
                if(S[xi] > T[xi]){
                    b = ">";
                    index = xi;
                }else if(S[xi] < T[xi]){
                    b = "<";
                    index = xi;
                }
                myout(b);
            }
        }
    }
    //Method addition frame start



    //Method addition frame end
}