#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;
typedef pair<P,ll> PP;

void Main() {
  ll n;
  cin >> n;
  vector<PP> a[2];
  rep(i,n) {
    char c,d;
    ll z;
    cin >> c >> d >> z;
    if(d=='R') a[0].pb(PP(P(z,c=='R'?1:0),i+1));
    else a[1].pb(PP(P(z,c=='R'?-1:0),i+1));
  }
  rep(i,2) sort(all(a[i]));
  vector<ll> ans;
  ll x=0,y=0,c=0,d=0;
  while(x<a[0].size()||y<a[1].size()) {
    int f1=0,f2=0;
    if(x<a[0].size()&&a[0][x].F.F==c) f1=1;
    if(y<a[1].size()&&a[1][y].F.F==d) f2=1;
    if(f1&&f2) {
      {
        if(a[0][x].F.S) c++;
        else d++;
        if(a[1][y].F.F!=d) f1=0;
        if(a[0][x].F.S) c--;
        else d--;
      }
      {
        if(a[1][y].F.S) c++;
        else d++;
        if(a[0][x].F.F!=c) f2=0;
        if(a[1][y].F.S) c--;
        else d--;
      }
    }
    if(f1) {
      if(a[0][x].F.S) c++;
      else d++;
      ans.pb(a[0][x].S);
      x++;
    } else if(f2) {
      if(a[1][y].F.S) c++;
      else d++;
      ans.pb(a[1][y].S);
      y++;
    } else {
      pr("No");
      return;
    }
  }
  pr("Yes");
  PR(ans,n);
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}