import java.io.BufferedReader import java.io.InputStream import java.io.InputStreamReader import java.lang.AssertionError import java.util.* import kotlin.math.abs import kotlin.math.max import kotlin.math.min val MOD = 1_000_000_007 /** * RangeUpdateTreeと同等と考える */ class BIT(val n: Int) { private val N = if (Integer.highestOneBit(n) == n) n else Integer.highestOneBit(n) shl 1 private val bit = IntArray(N + 1) /** * 0-indexed */ fun get(i: Int): Int { var x = i + 1 var s = 0 while(x > 0) { s += bit[x] x -= x and -x } return s } /** * i: 0-indexed */ fun addFrom(i: Int, a: Int) { var x = i + 1 while(x <= N) { bit[x] += a x += x and -x } } /** * i: 0-indexed */ fun addAt(i: Int, a: Int) { addFrom(i, a) addFrom(i + 1, -a) } private inline fun sub(a: Int, b: Int) = a - b private inline fun lt(a: Int, b: Int) = a < b /** * ↑の中身変えること * 累積後の値が単調増加になっていること * @return 0-indexed 見つからなかったら n */ fun lowerBound(W: Int): Int { var k = N var x = 0 var w = W while(k > 0) { if (x + k <= N && lt(bit[x + k], w)) { w = sub(w, bit[x + k]) x += k } k /= 2 } return min(n, x) } } class Solver(stream: InputStream, private val out: java.io.PrintWriter) { private val reader = BufferedReader(InputStreamReader(stream), 32768) fun solve() { val N = ni() val S = ns().map{it-'0'}.toIntArray() val T = ns().map{it-'0'}.toIntArray() val Q = ni() val bit = BIT(N) for (i in 0 until N) { if (S[i] != T[i]) bit.addFrom(i, 1) } for (q in 0 until Q) { val str = when(ns()) { "S" -> S else -> T } val i = ni() - 1 val d = ni() val prev = if (S[i] == T[i]) 0 else 1 str[i] = d val next = if (S[i] == T[i]) 0 else 1 val add = next - prev bit.addFrom(i, add) val idx = bit.lowerBound(1) val ans = if (idx == N) "=" else { if (S[idx] < T[idx]) "<" else ">" } out.println(ans) } } private val isDebug = try { // なんか本番でエラーでる System.getenv("MY_DEBUG") != null } catch (t: Throwable) { false } private var tokenizer: StringTokenizer? = null private fun next(): String { while (tokenizer == null || !tokenizer!!.hasMoreTokens()) { tokenizer = StringTokenizer(reader.readLine()) } return tokenizer!!.nextToken() } private fun ni() = next().toInt() private fun nl() = next().toLong() private fun ns() = next() private fun na(n: Int, offset: Int = 0): IntArray { return IntArray(n) { ni() + offset } } private fun nal(n: Int, offset: Int = 0): LongArray { val res = LongArray(n) for (i in 0 until n) { res[i] = nl() + offset } return res } private fun na2(n: Int, offset: Int = 0): Array { val a = Array(2){IntArray(n)} for (i in 0 until n) { for (e in a) { e[i] = ni() + offset } } return a } private inline fun debug(msg: () -> String) { if (isDebug) System.err.println(msg()) } /** * コーナーケースでエラー出たりするので、debug(dp[1])のように添え字付きの場合はdebug{}をつかうこと */ private inline fun debug(a: LongArray) { debug { a.joinToString(" ") } } private inline fun debug(a: IntArray) { debug { a.joinToString(" ") } } private inline fun debug(a: BooleanArray) { debug { toString(a) } } private inline fun toString(a: BooleanArray) = run{a.map { if (it) 1 else 0 }.joinToString("")} private inline fun debugDim(A: Array) { if (isDebug) { for (a in A) { debug(a) } } } private inline fun debugDim(A: Array) { if (isDebug) { for (a in A) { debug(a) } } } private inline fun debugDim(A: Array) { if (isDebug) { for (a in A) { debug(a) } } } /** * 勝手にimport消されるのを防ぎたい */ private fun hoge() { min(1, 2) max(1, 2) abs(-10) } private inline fun assert(b: Boolean) = run{if (!b) throw AssertionError()} private inline fun assert(b: Boolean, f: () -> String) = run{if (!b) throw AssertionError(f())} } fun main() { val out = java.io.PrintWriter(System.out) Solver(System.`in`, out).solve() out.flush() }