## https://yukicoder.me/problems/no/1640

from collections import deque

class UnionFind:
    """
    UnionFindの基本的な処理を実装したクラス
    """

    def __init__(self, size):
        self.root = [i for i in range(size)]
        self.size = [1] * size

    def get_root(self, v):
        if v == self.root[v]:
            return v
        else:
            old_root = self.root[v]
            new_root = self.get_root(old_root)
            self.root[v] = new_root
            return new_root

    def merge(self, u, v):
        root_u = self.get_root(u)
        root_v = self.get_root(v)
        if root_u == root_v:
            return False

        if self.size[root_u] >= self.size[root_v]:
            self.size[root_u] += self.size[root_v]
            self.root[root_v] = root_u
            self.root[v] = root_u
        else:
            self.size[root_v] += self.size[root_u]
            self.root[root_u] = root_v
            self.root[u] = root_v
        return True

def main():
    N = int(input())
    edges = []
    for _ in range(N):
        a, b = map(int, input().split())
        edges.append((a - 1, b - 1))
    
    # まずは塗ることができるかの判定
    uf = UnionFind(N)
    rest_edges = []
    for i in range(N):
        a, b = edges[i]
        if not uf.merge(a, b):
            rest_edges.append(i)
    
    composites = {}
    for i in range(N):
        root_i = uf.get_root(i)
        composites[root_i] = 0
    
    for i in rest_edges:
        a, _ = edges[i]
        root_i = uf.get_root(a)
        composites[root_i] += 1
    
    for v in composites.values():
        if v != 1:
            print("No")
            return
    print("Yes")

    # ボールの塗り方を調べる
    next_nodes = [[] for _ in range(N)]
    for i in range(N):
        a, b = edges[i]
        next_nodes[a].append((b , i))
        next_nodes[b].append((a , i))

    answer = [-1] * N
    passed = [False] * N
    for edge_index in rest_edges:
        s, _ = edges[edge_index]
        queue = deque()
        queue.append(s)
        passed[s] = True
        while len(queue) > 0:
            v = queue.popleft()
            for w, i in next_nodes[v]:
                if i == edge_index:
                    continue

                if not passed[w]:
                    answer[i] = w + 1
                    passed[w] = True
                    queue.append(w)
        answer[edge_index] = s + 1
    for i in range(N):
        print(answer[i])
            




        




            
    





if __name__ == "__main__":
    main()