#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> solve(deque<Ball> red,deque<Ball> blue){
	deque<Ball> ret;
	map<char,int> mp;
	while(red.size()!=0||blue.size()!=0){
		if(red.size()==0){
			if(mp['B']==blue.front().ncnt){
				mp[blue.front().color]++;
				ret.push_back(blue.front());
				blue.pop_front();
			}
			else return ret;
		}
		else if(blue.size()==0){
			if(mp['R']==red.front().ncnt){
				mp[red.front().color]++;
				ret.push_back(red.front());
				red.pop_front();
			}
			else return ret;
		}
		else{
			bool f0 = (mp['R']==red.front().ncnt);
			bool f1 = (mp['B']==blue.front().ncnt);
			if(!f0&&!f1)return ret;
			if(f0&&!f1){
				mp[red.front().color]++;
				ret.push_back(red.front());
				red.pop_front();
			}
			else if(!f0){
				mp[blue.front().color]++;
				ret.push_back(blue.front());
				blue.pop_front();
			}
			else{
				if(red.front().color=='R'){
					mp[red.front().color]++;
					ret.push_back(red.front());
					red.pop_front();
				}
				else if(blue.front().color=='B'){
					mp[blue.front().color]++;
					ret.push_back(blue.front());
					blue.pop_front();
				}
				else{
					return ret;
				}
			}
		}
	}
	
	return ret;
}

int main(){
	
	int N;
	cin>>N;
	
	deque<Ball> red,blue;
	
	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.ncolor<b.ncolor;
	});
	
	sort(blue.begin(),blue.end(),[&](Ball a,Ball b){
		if(a.ncnt!=b.ncnt)return a.ncnt<b.ncnt;
		return a.ncolor>b.ncolor;
	});
	
	deque<Ball> ans = solve(red,blue);

	if(ans.size()!=N){
		cout<<"No"<<endl;
	}
	else{
		cout<<"Yes"<<endl;
		rep(i,N){
			if(i!=0)printf(" ");
			printf("%d",ans[i].ind+1);
		}
		cout<<endl;
	}
	
	return 0;
}