#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrep1(i, n) for (int i = n; i >= 1; i--)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define eb emplace_back
#define fi first
#define se second
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
typedef long long int ll;
typedef pair<int, int> P;
// typedef modint1000000007 mint;

void speedUpIO() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
}

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;
}
/*--------------------------------------------------*/
const int INF = 1e9;
// const ll INF = 1e18;
const int MAX = 1e5;

void solve() {
    int n;
    string s, t;
    cin >> n >> s >> t;
    priority_queue<int, vector<int>, greater<int>> pq;
    pq.push(INF);
    rep(i, n) {
        if (s[i] != t[i]) pq.push(i);
    }
    int q;
    cin >> q;
    rep(qi, q) {
        char c;
        int x, y;
        cin >> c >> x >> y;
        x--;
        if (c == 'S') s[x] = y + '0';
        if (c == 'T') t[x] = y + '0';
        if (s[x] != t[x]) pq.push(x);
        string ans = "=";
        int now = pq.top();
        while (now != INF && s[now] == t[now]) {
            pq.pop();
            now = pq.top();
        }
        if (now != INF) {
            if (s[now] > t[now]) ans = ">";
            if (s[now] < t[now]) ans = "<";
        }
        cout << ans << "\n";
    }
}

int main() {
    speedUpIO();
    solve();
    // cout << solve() << "\n";
    return 0;
}