mod = 1000000007
eps = 10**-9


def main():
    import sys
    from collections import deque
    input = sys.stdin.buffer.readline

    N = int(input())
    ans = [-1] * N
    AB = []
    cnt = [set() for _ in range(N+1)]
    for i in range(N):
        a, b = map(int, input().split())
        AB.append((a, b))
        cnt[a].add(i)
        cnt[b].add(i)

    que = deque()
    for v in range(1, N+1):
        if len(cnt[v]) == 0:
            print("No")
            exit()
        elif len(cnt[v]) == 1:
            que.append(v)
    while que:
        v = que.pop()
        if len(cnt[v]) == 0:
            print("No")
            exit()
        for i in cnt[v]:
            ans[i] = v
            a, b = AB[i]
            u = a + b - v
            if u != v:
                cnt[u].discard(i)
                if len(cnt[u]) == 1:
                    que.append(u)
    for v0 in range(1, N+1):
        if len(cnt[v0]) == 0:
            continue
        v = v0
        while True:
            i = list(cnt[v])[0]
            ans[i] = v
            a, b = AB[i]
            u = a + b - v
            cnt[v].discard(i)
            if u != v:
                cnt[u].discard(i)
                v = u
            if len(cnt[v]) == 0:
                break
    assert len(set(ans)) == N and sum(ans) == N * (N+1) // 2
    print("Yes")
    for i in range(N):
        print(ans[i])


if __name__ == '__main__':
    main()