#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

int main(){
    int N;
    cin >> N;

    vector<char> C(N), X(N);
    vector<int> Y(N);
    rep(i, N) cin >> C[i] >> X[i] >> Y[i];
    vector<int> R, B;
    rep(i, N){
        if(X[i] == 'R') R.eb(i);
        if(X[i] == 'B') B.eb(i);
    }
    sort(all(R), [&](int i, int j){
        if(Y[i] != Y[j]) return Y[i] < Y[j];
        return C[i] == 'B';
    });
    sort(all(B), [&](int i, int j){
        if(Y[i] != Y[j]) return Y[i] < Y[j];
        return C[i] == 'R';
    });

    int P = sz(R), Q = sz(B);
    int i = 0, j = 0, r = 0, b = 0;
    vector<int> ans;
    while(i < P || j < Q){
        if((i == P || Y[R[i]] != r) && (j == Q || Y[B[j]] != b)) {cout << "No\n"; return 0;}
        if(i == P || Y[R[i]] != r || (j < Q && Y[B[j]] == b && C[B[j]] == 'B') ){
            ans.eb(B[j]);
            (C[B[j]] == 'R'? r : b)++, j++;
        }
        else{
            ans.eb(R[i]);
            (C[R[i]] == 'R'? r : b)++, i++;
        }
    }

    cout << "Yes\n";
    rep(i, N){
        cout << ans[i]+1;
        cout << (i == N-1? '\n' : ' ');
    }
}