#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000000000000

struct Ball{
	char color,ncolor;
	int ncnt;
	int ind;
};
deque<Ball> red,blue;
deque<Ball> ret;
map<char,int> mp;

void NG(){
	cout<<"No"<<endl;
	exit(0);
}

void OK(){
	cout<<"Yes"<<endl;

	rep(i,ret.size()){
		if(i!=0)printf(" ");
		printf("%d",ret[i].ind+1);
	}
	cout<<endl;
	exit(0);
}

void solve(){
	
	if(red.size()==0&&blue.size()==0)OK();
	
	if(red.size()==0){
		if(mp['B']==blue.front().ncnt){
			mp[blue.front().color]++;
			ret.push_back(blue.front());
			blue.pop_front();
			solve();
			blue.push_front(ret.back());
			ret.pop_back();
			mp[blue.front().color]--;
		}
	}
	else if(blue.size()==0){
		if(mp['R']==red.front().ncnt){
			mp[red.front().color]++;
			ret.push_back(red.front());
			red.pop_front();
			solve();
			red.push_front(ret.back());
			ret.pop_back();
			mp[red.front().color]--;
		}
	}
	else{
		bool f0 = (mp['R']==red.front().ncnt);
		bool f1 = (mp['B']==blue.front().ncnt);

		if(!f0&&!f1)return;
		if(f0&&!f1){
			mp[red.front().color]++;
			ret.push_back(red.front());
			red.pop_front();
			solve();
			red.push_front(ret.back());
			ret.pop_back();
			mp[red.front().color]--;
		}
		else if(!f0){
			mp[blue.front().color]++;
			ret.push_back(blue.front());
			blue.pop_front();
			solve();
			blue.push_front(ret.back());
			ret.pop_back();
			mp[blue.front().color]--;
		}
		else{
			mp[red.front().color]++;
			ret.push_back(red.front());
			red.pop_front();
			
			solve();
			
			red.push_front(ret.back());
			ret.pop_back();
			mp[red.front().color]--;
			
			mp[blue.front().color]++;
			ret.push_back(blue.front());
			blue.pop_front();
			
			solve();
			
			blue.push_front(ret.back());
			ret.pop_back();
			mp[blue.front().color]--;			
		}
	}
	
}

int main(){
	
	int N;
	cin>>N;
	
	
	rep(i,N){
		char c,x;
		int y;
		cin>>c>>x>>y;
		
		Ball b;
		b.color = c;
		b.ncolor = x;
		b.ncnt = y;
		b.ind = i;
		
		if(x=='R')red.push_back(b);
		else blue.push_back(b);
	}
	
	sort(red.begin(),red.end(),[&](Ball a,Ball b){
		if(a.ncnt!=b.ncnt)return a.ncnt<b.ncnt;
		return a.color<b.color;
	});
	
	sort(blue.begin(),blue.end(),[&](Ball a,Ball b){
		if(a.ncnt!=b.ncnt)return a.ncnt<b.ncnt;
		return a.color>b.color;
	});
	
	solve();
	
	NG();
	
	return 0;
}