#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;

//template
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
//end

typedef pair<char,pair<char,int>> T;
string col="RB";
void fail(){puts("No"); exit(0);}

int main(){
   int n; cin>>n;
   vector<char> c(n),x(n); vector<int> y(n);
   rep(i,0,n)cin>>c[i]>>x[i]>>y[i];
   map<T,set<int>> cnt;
   rep(i,0,n)cnt[{c[i],{x[i],y[i]}}].insert(i);

   int cur[2]={};
   vector<int> res;
   rep(_,0,n){
      int tar=0,pre[4]={},sum=0;
      rep(i,0,2)rep(j,0,2){
         pre[i+j*2]=cnt[{col[i],{col[j],cur[j]}}].size();
         if(pre[i+j*2])sum++;
      }
      if(sum==0)fail();
      if(sum==1){
         for(tar=0;tar<4;tar++)if(pre[tar]){
            break;
         }
      }
      else{
         if(pre[1] and pre[2])fail();
         if(pre[0] and pre[1])tar=1;
         if(pre[2] and pre[3])tar=2;
         if(pre[0] and pre[2])tar=0;
         if(pre[1] and pre[3])tar=3;
      }
      int idx=*cnt[{col[tar&1],{col[tar>>1],cur[tar>>1]}}].begin();
      cnt[{col[tar&1],{col[tar>>1],cur[tar>>1]}}].erase(idx);

      res.push_back(idx);
      cur[(c[idx]=='R'?0:1)]++;
   }

   puts("Yes");
   rep(i,0,n)cout<<res[i]+1<<(i==n-1?'\n':' ');
   return 0;
}