#include"bits/stdc++.h"
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

signed main(){
    int N;cin>>N;
    string S,T;cin>>S>>T;

    set<int> s,t;
    rep(i,N){
        if(S[i]>T[i]) s.insert(i);
        if(S[i]<T[i]) t.insert(i);
    }

    int Q;cin>>Q;
    while(Q--){
        char st;cin>>st;
        int x,y;cin>>x>>y;x--;
        if(st=='S') S[x]=y+'0';
        else        T[x]=y+'0';

        if(s.count(x)) s.erase(x);
        if(t.count(x)) t.erase(x);

        if(S[x]>T[x]) s.insert(x);
        if(S[x]<T[x]) t.insert(x);
        
        // cout<<endl<<"! "<<endl;
        // cout<<S<<endl;
        int sfs=INF,tfs=INF;
        if(!s.empty()) sfs=*begin(s);
        if(!t.empty()) tfs=*begin(t);

        if(sfs<tfs)      cout<<">"<<endl;
        else if(sfs>tfs) cout<<"<"<<endl;
        else             cout<<"="<<endl;
        // cout<<T<<endl;

        // debug(s);
        // debug(t);
    }
    return 0;
}