#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>

#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
template<typename... Ts> void input(Ts&... ts) { (cin >> ... >> ts); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
// clang-format on

// C, Y, idx
using T = tuple<char, int, int, char>;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    input(n);
    vector<char> c(n), x(n);
    vector<int> y(n);
    rep(i, 0, n) {
        input(c[i], x[i], y[i]);
    }
    vector<T> Red, Blue;
    rep(i, 0, n) {
        (x[i] == 'R' ? Red : Blue).emplace_back(c[i], y[i], i, x[i]);
    }
    sort(Red.begin(), Red.end(), [&](const T &r1, const T &r2) -> bool {
        if (get<1>(r1) != get<1>(r2)) return get<1>(r1) < get<1>(r2);
        return get<0>(r1) < get<0>(r2);  // B < R
    });
    sort(Blue.begin(), Blue.end(), [&](const T &r1, const T &r2) -> bool {
        if (get<1>(r1) != get<1>(r2)) return get<1>(r1) < get<1>(r2);
        return get<0>(r1) > get<0>(r2);  // B > R
    });
    int red = 0, blue = 0;
    int ridx = 0, bidx = 0;
    vector<int> ans;
    auto process = [&](vector<T> &color, int &i) {
        if (color.size() <= i) return false;
        auto [ci, yi, idx, xi] = color[i];
        dump(idx + 1, red, blue, yi);
        if ((xi == 'R' ? red : blue) != yi) {
            return false;
        }
        (ci == 'R' ? red : blue)++;
        i++;
        dump(idx + 1);
        ans.emplace_back(idx);
        return true;
    };
    rep(i, 0, n) {
        dump(i, ridx, bidx, red, blue);
        if (Red.size() <= ridx) {
            if (!process(Blue, bidx)) {
                print("No");
                dump("a");
                return 0;
            }
        } else if (Blue.size() <= bidx) {
            if (!process(Red, ridx)) {
                print("No");
                dump("a");
                return 0;
            }
        } else {
            bool rs = get<1>(Red[ridx]) == red, bs = get<1>(Blue[bidx]) == blue;
            if (rs || bs) {
                if (rs && !bs) {
                    if (!process(Red, ridx)) {
                        print("No");
                        dump("a");
                        return 0;
                    }
                } else if (!rs && bs) {
                    if (!process(Blue, bidx)) {
                        print("No");
                        dump("a");
                        return 0;
                    }
                } else {
                    if (get<0>(Red[ridx]) == 'R') {
                        if (!process(Red, ridx)) {
                            print("No");
                            dump("a");
                            return 0;
                        }
                    } else {
                        if (!process(Blue, bidx)) {
                            print("No");
                            dump("a");
                            return 0;
                        }
                    }
                }
            } else {
                print("No");
                dump("a");
                return 0;
            }
        }
    }
    print("Yes");
    rep(i, 0, n) {
        cout << ans[i] + 1 << " \n"[i + 1 == n];
    }

    return 0;
}