#include<stdio.h>
int h[400005], l;
int comp_h(int a, int b)
{
	if (h[a] > h[b])
		return 1;
	else
		return -1;
}
void swap_h(int a, int b)
{
	int f = h[a];
	h[a] = h[b];
	h[b] = f;
	return;
}
void push(int ne)
{
	h[l] = ne;
	int p = l;
	l++;
	for (; p > 0; p = (p - 1) / 2)
		if (comp_h((p - 1) / 2, p) > 0)
			swap_h((p - 1) / 2, p);
	return;
}
int pop()
{
	l--;
	swap_h(0, l);
	int p = 0;
	for (;;)
	{
		if (2 * p + 2 < l)
		{
			if (comp_h(2 * p + 1, 2 * p + 2) > 0)
			{
				if (comp_h(p, 2 * p + 2) > 0)
					swap_h(p, 2 * p + 2);
				p = 2 * p + 2;
			}
			else
			{
				if (comp_h(p, 2 * p + 1) > 0)
					swap_h(p, 2 * p + 1);
				p = 2 * p + 1;
			}
		}
		else if (2 * p + 1 < l)
		{
			if (comp_h(p, 2 * p + 1) > 0)
				swap_h(p, 2 * p + 1);
			p = 2 * p + 1;
		}
		else
			break;
	}
	return h[l];
}
char s[200005], t[200005];
int main()
{
	int n;
	scanf("%d", &n);
	scanf("%s%s", s, t);
	int q;
	scanf("%d", &q);
	char c[4];
	int x, y;
	int i, j, k;
	l = 0;
	for (i = 0; i < n; i++)
	{
		if (s[i] != t[i])
			push(i);
	}
	for (i = 0; i < q; i++)
	{
		scanf("%s %d %d", &c, &x, &y);
		x--;
		if (c[0] == 'S')
			s[x] = '0' + y;
		else
			t[x] = '0' + y;
		if (s[x] != t[x])
			push(x);
		k = -1;
		while (l > 0)
		{
			j = pop();
			if (s[j] != t[j])
			{
				k = j;
				push(j);
				break;
			}
		}
		if (k < 0)
			printf("=\n");
		else if (s[k] < t[k])
			printf("<\n");
		else
			printf(">\n");
	}
	return 0;
}