#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;

typedef long long ll;

int main() {
    int N, Q;
    string S, T;
    cin >> N >> S >> T >> Q;
    vector<char> c(Q), y(Q);
    vector<int> x(Q);
    rep(i, Q) {
        cin >> c[i] >> x[i] >> y[i];
        x[i]--;
    }
    int idx = 0;
    while (idx < N && S[idx] == T[idx]) idx++;
    rep(i, Q) {
        if (c[i] == 'S') {
            S[x[i]] = y[i];
        } else {
            T[x[i]] = y[i];
        }
        if (x[i] == idx) {
            while (idx < N && S[idx] == T[idx]) idx++;
        } else if (x[i] < idx && S[x[i]] != T[x[i]]) {
            idx = x[i];
        }
        if (idx == N) {
            cout << "=\n";
        } else if (S[idx] < T[idx]) {
            cout << "<\n";
        } else {
            cout << ">\n";
        }
    }
}