#include "bits/stdc++.h"
#include "atcoder/all"
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
int op(int a, int b) {
	int ret;
	if (0 == a) { ret = b; }
	else { ret = a; }
	return ret;
}

int e() {
	return -1;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int N;
	cin >> N;
	string S, T;
	cin >> S >> T;
	vector<int>v(N);
	rep(i, N) {
		if (S[i] > T[i]) { v[i] = -1; }
		else if (S[i] < T[i]) { v[i] = 1; }
		else { v[i] = 0; }
	}
	segtree<int, op, e>seg(v);
	int Q;
	cin >> Q;
	while (Q--) {
		char c, y; int x;
		cin >> c >> x >> y;
		x--;
		if ('S' == c) { S[x] = y; }
		else { T[x] = y; }
		if (S[x] > T[x]) { seg.set(x, -1); }
		else if (S[x] < T[x]) { seg.set(x, 1); }
		else { seg.set(x, 0); }
		int num = seg.all_prod();
		if (-1 == num) { cout << ">" << endl; }
		else if (1 == num) { cout << "<" << endl; }
		else { cout << "=" << endl; }
	}
	return 0;
}