import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

N = int(input())
red_red = [[] for _ in range(N + 1)]
red_blue = [[] for _ in range(N + 1)]
blue_blue = [[] for _ in range(N + 1)]
blue_red = [[] for _ in range(N + 1)]

for i in range(1, N+1):
    c, x, y = input().rstrip().split()
    y = int(y)
    if c == "R":
        if x == "R":
            red_red[y].append(i)
        else:
            red_blue[y].append(i)
    else:
        if x == "R":
            blue_red[y].append(i)
        else:
            blue_blue[y].append(i)


ans = []


def rec(R, B):
    if R + B == N:
        return True

    if red_red[R]:
        sz = len(red_red[R])
        while red_red[R]:
            ans.append(red_red[R].pop())
        if rec(R + sz, B):
            return True
        for _ in range(sz):
            red_red[R].append(ans.pop())

    if red_blue[B]:
        sz = len(red_blue[B])
        while red_blue[B]:
            ans.append(red_blue[B].pop())
        if rec(R + sz, B):
            return True
        for _ in range(sz):
            red_blue[B].append(ans.pop())

    if blue_red[R]:
        sz = len(blue_red[R])
        while blue_red[R]:
            ans.append(blue_red[R].pop())
        if rec(R, B + sz):
            return True
        for _ in range(sz):
            blue_red[R].append(ans.pop())

    if blue_blue[B]:
        sz = len(blue_blue[B])
        while blue_blue[B]:
            ans.append(blue_blue[B].pop())
        if rec(R, B + sz):
            return True
        for _ in range(sz):
            blue_blue[B].append(ans.pop())

    return False


if not rec(0, 0):
    print("No")
else:
    print("Yes")
    print(*ans)