import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

class UnionFind:
    def __init__(self, n):
        self.state = [-1]*n
        self.e = [0]*n
        self.size_table = [1]*n
        # cntはグループ数
        self.cnt = n

    def root(self, u):
        stack = []
        while self.state[u] >= 0:
            stack.append(u)
            u = self.state[u]
        for v in stack: self.state[v] = u
        return u

    def merge(self, u, v):
        u = self.root(u)
        v = self.root(v)
        self.e[u] += 1
        if u == v: return
        du = -self.state[u]
        dv = -self.state[v]
        if du < dv: u, v = v, u
        if du == dv: self.state[u] -= 1
        self.state[v] = u
        self.cnt -= 1
        self.size_table[u] += self.size_table[v]
        self.e[u] += self.e[v]
        return

    # グループの要素数
    def size(self, u):
        return self.size_table[self.root(u)]

    def cnt_egde(self, u):
        u = self.root(u)
        return self.e[u]

n = II()
uf = UnionFind(n)
to = [[] for _ in range(n)]
for i in range(n):
    a, b = LI1()
    to[a].append((b, i))
    to[b].append((a, i))
    uf.merge(a, b)

fin = set()
for u in range(n):
    u = uf.root(u)
    if u in fin: continue
    fin.add(u)
    if uf.size(u) != uf.cnt_egde(u):
        print("No")
        exit()

def dfs(u):
    stack = [(u, -1)]
    while stack:
        u, par = stack.pop()
        for v, i in to[u]:
            if v == par: continue
            if vis[v]:
                ans[i] = v+1
                ee[i] = True
                return v
            vis[v] = True
            stack.append((v, u))

def match(u):
    stack = [u]
    while stack:
        u = stack.pop()
        for v, i in to[u]:
            if ee[i]: continue
            ee[i] = True
            ans[i] = v+1
            stack.append(v)

ans = [-1]*n
ee = [False]*n
vis = [False]*n
for u in fin:
    r = dfs(u)
    match(r)

print("Yes")
print(*ans, sep="\n")