#include<bits/stdc++.h>
using namespace std;

//#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=MOD;
const ll MAX=2000010;



signed main(){
    ll n;cin>>n;
    string s,t;cin>>s>>t;
    set<ll>st;
    rep(i,n)st.insert(i);
    rep(i,n){
        if(s[i]==t[i])st.erase(i);
    }
    ll q;cin>>q;
    while(q--){
        char c;cin>>c;
        ll x,y;cin>>x>>y;
        x--;
        if(c=='T'){
            t[x]='0'+y;
        }else{
            s[x]='0'+y;
        }
        if(s[x]==t[x])st.erase(x);
        else st.insert(x);
        auto k=st.lower_bound(-1LL);
        if(k==st.end()){
            cout<<'='<<endl;
        }else{
            ll l=*k;
            if(s[l]<t[l])cout<<'<'<<endl;
            else cout<<'>'<<endl;
        }
    }
}