class UnionFind(): def __init__(self, n): self.n = n self.parents = [-1] * n self.hasloop = [False] * n self.group = n def find(self, x): if self.parents[x] < 0: return x else: self.parents[x] = self.find(self.parents[x]) return self.parents[x] def union(self, x, y): x = self.find(x) y = self.find(y) if x == y: self.hasloop[x] = True return self.group -= 1 if self.parents[x] > self.parents[y]: x, y = y, x self.hasloop[x] |= self.hasloop[y] self.parents[x] += self.parents[y] self.parents[y] = x def size(self, x): return -self.parents[self.find(x)] def same(self, x, y): return self.find(x) == self.find(y) def members(self, x): root = self.find(x) return [i for i in range(self.n) if self.find(i) == root] def roots(self): return [i for i, x in enumerate(self.parents) if x < 0] def group_count(self): return self.group def all_group_members(self): dic = {r:[] for r in self.roots()} for i in range(self.n): dic[self.find(i)].append(i) return dic def __str__(self): return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots()) n = int(input()) ab = [] UF = UnionFind(n) edges = [[] for _ in range(n)] ans = [-1] * n used = [False] * n stack = [] for i in range(n): a, b = map(int, input().split()) a -= 1 b -= 1 if UF.same(a, b): ans[i] = a + 1 stack.append(a) used[i] = True else: edges[a].append((b, i)) edges[b].append((a, i)) UF.union(a, b) for r in UF.roots(): if not UF.hasloop[r]: print("No") exit() print("Yes") while stack: pos = stack.pop() for npos, i in edges[pos]: if used[i]: continue used[i] = True ans[i] = npos + 1 stack.append(npos) print(*ans, sep="\n")