#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <deque>
#include <stack>
#include <atcoder/all>

using namespace std;

#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,k,n) for(int i=(k);i<(int)(n);i++)
#define all(i,n) (i),(i+n)

int dx4[4]={1,0,-1,0};
int dy4[4]={0,-1,0,1};
int dx8[8]={1,0,-1,1,-1,1,0,-1};
int dy8[8]={1,1,1,0,0,-1,-1,-1};

typedef pair<int, int> P;
typedef pair<string, int> SP;
typedef long long ll;
typedef pair<ll, ll> PLL;

const int INF = 1e9;
const ll LLINF = 1e18;
const int MAX_V = 1e6+1;
const ll mod = 1e9 + 7;
//  cout << fixed << setprecision(10)
// --------------------------------------
int n, q;
string s, t;
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  cin >> n >> s >> t >> q;
  char c, y;
  int x;
  REP(i, q) {
    cin >> c >> x >> y;
    if(c == 'S') s[x - 1] = y;
    else t[x - 1] = y;

    bool f = true;
    REP(j, n) {
      int ns = s[j] - '0';
      int nt = t[j] - '0';
      if(ns > nt) {
        cout << ">" << endl;
        f = false;
        break;
      } else if(ns < nt) {
        cout << "<" << endl;
        f = false;
        break;
      }
    }
    if(!f) continue;
    cout << "=" << endl;
  }
}