#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N;
	cin >> N;
	string S, T;
	cin >> S >> T;
	
	set<int> ss;
	REP(i, N) if (S[i] != T[i]) ss.emplace(i);
	
	int Q;
	cin >> Q;
	while (Q--) {
		char c;
		int x, y;
		scanf(" %c %d %d", &c, &x, &y);
		--x;
		ss.erase(x);
		(c == 'S' ? S[x] : T[x]) = y + '0';
		if (S[x] != T[x]) ss.emplace(x);
		if (ss.empty()) puts("=");
		else {
			const int p = *ss.begin();
			puts(S[p] < T[p] ? "<" : ">");
		}
	}
}