#![allow(unused_imports, unused_macros, dead_code)]
use std::cmp::*;
use std::collections::*;

macro_rules! min {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        it.next().map(|z| it.fold(z, |x, y| min!(x, y)))
    }};
    ($x:expr) => ($x);
    ($x:expr, $($ys:expr),*) => {{
        let t = min!($($ys),*);
        if $x < t { $x } else { t }
    }}
}
macro_rules! max {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        it.next().map(|z| it.fold(z, |x, y| max!(x, y)))
    }};
    ($x:expr) => ($x);
    ($x:expr, $($ys:expr),*) => {{
        let t = max!($($ys),*);
        if $x > t { $x } else { t }
    }}
}
macro_rules! trace {
    ($x:expr) => {
        #[cfg(debug_assertions)]
        eprintln!(">>> {} = {:?}", stringify!($x), $x)
    };
    ($($xs:expr),*) => { trace!(($($xs),*)) }
}
macro_rules! put {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        if let Some(x) = it.next() { print!("{}", x); }
        for x in it { print!(" {}", x); }
        println!("");
    }};
    ($x:expr) => { println!("{}", $x) };
    ($x:expr, $($xs:expr),*) => { print!("{} ", $x); put!($($xs),*) }
}

const M: i64 = 1_000_000_007;

#[derive(Debug, Clone, Copy)]
struct Ball {
    c: char,
    x: char,
    y: usize,
    id: usize,
}

fn main() {
    let mut sc = Scanner::new();
    let n: usize = sc.cin();
    let mut rs = vec![];
    let mut bs = vec![];

    for i in 0..n {
        let c: char = sc.cin();
        let x: char = sc.cin();
        let y: usize = sc.cin();
        let b = Ball { c, x, y, id: i + 1 };
        if x == 'R' {
            rs.push(b);
        } else {
            bs.push(b);
        }
    }

    rs.sort_by_key(|ball| (Reverse(ball.y), Reverse(ball.c)));
    bs.sort_by_key(|ball| (Reverse(ball.y), ball.c));

    let mut ans = vec![];
    let mut num = DefaultDict::new(0);
    let mut success = true;

    loop {
        trace!(&rs);
        trace!(&bs);
        trace!(&ans, &num);
        match (rs.pop(), bs.pop()) {
            (None, None) => break,
            (Some(b), None) => {
                if num[b.x] == b.y {
                    ans.push(b.id);
                    num[b.c] += 1;
                } else {
                    success = false;
                    break;
                }
            }
            (None, Some(b)) => {
                if num[b.x] == b.y {
                    ans.push(b.id);
                    num[b.c] += 1;
                } else {
                    success = false;
                    break;
                }
            }
            (Some(a), Some(b)) => {
                if num[a.x] == a.y && num[b.x] == b.y {
                    if a.c == 'R' {
                        ans.push(a.id);
                        num[a.c] += 1;
                        bs.push(b);
                    } else {
                        ans.push(b.id);
                        num[b.c] += 1;
                        rs.push(a);
                    }
                } else if num[a.x] == a.y {
                    ans.push(a.id);
                    num[a.c] += 1;
                    bs.push(b);
                } else if num[b.x] == b.y {
                    ans.push(b.id);
                    num[b.c] += 1;
                    rs.push(a);
                } else {
                    success = false;
                    break;
                }
            }
        }
    }

    if success {
        put!("Yes");
        put!(..ans);
    } else {
        put!("No");
    }
}

// @collections/defaultdict
#[derive(Debug, Clone)]
pub struct DefaultDict<K, V>
where
    K: Eq + std::hash::Hash,
{
    data: std::collections::HashMap<K, V>,
    default: V,
}
impl<K: Eq + std::hash::Hash, V> DefaultDict<K, V> {
    pub fn new(default: V) -> DefaultDict<K, V> {
        DefaultDict {
            data: std::collections::HashMap::new(),
            default,
        }
    }
    pub fn keys(&self) -> std::collections::hash_map::Keys<K, V> {
        self.data.keys()
    }
    pub fn iter(&self) -> std::collections::hash_map::Iter<K, V> {
        self.data.iter()
    }
    pub fn len(&self) -> usize {
        self.data.len()
    }
}
impl<K: Eq + std::hash::Hash, V> std::ops::Index<K> for DefaultDict<K, V> {
    type Output = V;
    fn index(&self, key: K) -> &Self::Output {
        if let Some(val) = self.data.get(&key) {
            val
        } else {
            &self.default
        }
    }
}
impl<K: Eq + std::hash::Hash + Clone, V: Clone> std::ops::IndexMut<K> for DefaultDict<K, V> {
    fn index_mut(&mut self, key: K) -> &mut Self::Output {
        let val = self.default.clone();
        self.data.entry(key.clone()).or_insert(val);
        self.data.get_mut(&key).unwrap()
    }
}

use std::collections::VecDeque;
use std::io::{self, Write};
use std::str::FromStr;

struct Scanner {
    stdin: io::Stdin,
    buffer: VecDeque<String>,
}
impl Scanner {
    fn new() -> Self {
        Scanner {
            stdin: io::stdin(),
            buffer: VecDeque::new(),
        }
    }
    fn cin<T: FromStr>(&mut self) -> T {
        while self.buffer.is_empty() {
            let mut line = String::new();
            let _ = self.stdin.read_line(&mut line);
            for w in line.split_whitespace() {
                self.buffer.push_back(String::from(w));
            }
        }
        self.buffer.pop_front().unwrap().parse::<T>().ok().unwrap()
    }
    fn chars(&mut self) -> Vec<char> {
        self.cin::<String>().chars().collect()
    }
    fn vec<T: FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.cin()).collect()
    }
}
fn flush() {
    std::io::stdout().flush().unwrap();
}