use std::collections::BTreeMap;

fn run<'a, I, W>(mut scanner: I, mut writer: W)
where
    I: Iterator<Item = &'a str>,
    W: std::io::Write,
{
    macro_rules! scan {
        ([$t:tt; $n:expr]) => ((0..$n).map(|_| scan!($t)).collect::<Vec<_>>());
        (($($t:tt),*)) => (($(scan!($t)),*));
        (Usize1) => (scan!(usize) - 1);
        (Bytes) => (scan!(String).into_bytes());
        ($t:ty) => (scanner.next().unwrap().parse::<$t>().unwrap());
    }
    macro_rules! input {
        ($($($v:ident)* : $t:tt),* $(,)?) => ($(let $($v)* = scan!($t);)*);
    }
    
    input! {
        _n: usize,
        mut s: Bytes,
        mut t: Bytes,
    }

    let mut map = BTreeMap::new();

    for (i, (a, b)) in s.iter().zip(t.iter()).enumerate() {
        if a > b {
            map.insert(i, b'>');
        } else if a < b {
            map.insert(i, b'<');
        }
    }

    for _ in 0..scan!(usize) {
        input! {
            c: char, x: Usize1, y: char,
        }

        match c {
            'S' => {
                s[x] = y as u8;
            }
            'T' => {
                t[x] = y as u8;
            }
            _ => (),
        }

        if s[x] > t[x] {
            map.insert(x, b'>');
        } else if s[x] < t[x] {
            map.insert(x, b'<');
        } else {
            map.remove(&x);
        }

        if let Some(&ans) = map.values().next() {
            writer.write_all(&[ans, b'\n']).ok();
        } else {
            writer.write_all(b"=\n").ok();
        }
    }
}

fn main() {
    let ref mut buf = Vec::new();
    std::io::Read::read_to_end(&mut std::io::stdin(), buf).ok();
    let scanner = unsafe {
        std::str::from_utf8_unchecked(buf).split_ascii_whitespace()
    };

    let stdout = std::io::stdout();
    let writer = std::io::BufWriter::new(stdout.lock());

    run(scanner, writer);
}