from collections import defaultdict import sys from collections import defaultdict, Counter, deque from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate import operator from math import sqrt, gcd, factorial # from math import isqrt, prod, comb #python3.8用(notpypy) #from bisect import bisect_left, bisect_right #from functools import lru_cache, reduce #from heapq import heappush, heappop, heapify, heappushpop, heapreplace #import numpy as np #import networkx as nx #from networkx.utils import UnionFind #from numba import njit, b1, i1, i4, i8, f8 # numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1 #from scipy.sparse import csr_matrix #from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError, maximum_bipartite_matching, maximum_flow, minimum_spanning_tree def input(): return sys.stdin.readline().rstrip() def divceil(n, k): return 1+(n-1)//k # n/kの切り上げを返す def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no) # https://note.nkmk.me/python-union-find/から一部改変 class UnionFind(): def __init__(self, n): self.n = n self.parents = [-1] * n self.group_num = n self.check = [0]*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: return self.group_num -= 1 if self.parents[x] > self.parents[y]: x, y = y, x self.parents[x] += self.parents[y] self.parents[y] = x self.check[x] |= self.check[y] 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_num def all_group_members(self): self.all_group_member = defaultdict(list) for i in range(self.n): self.all_group_member[self.find(i)].append(i) return self.all_group_member def __str__(self): return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots()) def main(): mod = 10**9+7 mod2 = 998244353 n = int(input()) uf = UnionFind(n) ab = [list(map(lambda x: int(x)-1, input().split())) for i in range(n)] ans = [None]*n left = [] edges = [[] for i in range(n)] for i, (a, b) in enumerate(ab): if uf.same(a, b): if uf.check[uf.find(a)]: yn(0) return uf.check[uf.find(a)] = 1 left.append(a) ans[i] = a+1 else: uf.union(a, b) edges[b].append([a, i]) edges[a].append([b, i]) if 0 != 0: pass else: yn(1) d = deque() dist = [-1]*n for l in left: d.append(l) dist[l] = 0 while d: v = d.popleft() for i, edgenum in edges[v]: if dist[i] != -1: continue dist[i] = dist[v] + 1 ans[edgenum] = i+1 d.append(i) print(*ans, sep="\n") if __name__ == '__main__': main()