## Problem S3: Friends

In a certain school, it has been decided that students are spending too much time studying and not enough time socializing. To address this situation, it has been decided to give every student a friend. Friendship is one-way. That is, if Janet is assigned to be Sarah’s friend, Janet must be friendly to Sarah, but Sarah is not required to reciprocate.

The assignment of friends is done by computer using student numbers. Every student is assigned exactly one friend. Sometimes, a ‘circle of friends’ occurs. For example, if Marc is assigned Fred, Fred is assigned Lori, Lori is assigned Jean, and Jean assigned Marc, we have a circle of 4 friends containing Marc, Fred, Lori, and Jean. In the circle, we can say that Marc has a separation of 0 from Fred, of 1 from Lori, of 2 from Jean, and of 3 from Marc.

Your task it to identify, given the computer assignment of friends, whether two students are in the same circle of friends, and if so, determine their separation.

### Input

Input begins with a single integer n (2 ≤ n ≤ 9999), on a line by itself, indicating the number of students in the class. The next n lines contain the computer assignment of friendship. An assignment is of the form x y (where 1 ≤ x ≤ 9999, 1 ≤ y ≤ 9999, xy). For example, 1234 8765 is a possible friendship assignment indicating that student 1234 must be friends with student 8765.

Following the friendship assignments, there are a series of lines containing two student numbers, separated by a single whitespace. These lines represent the pairs of students that you will determine if they are in same circle of friends and, if so, their separation. The last line of input can be identified by the use of the 0 0 as the friend assignment.

### Output

For each case, you are to print, on a separate line, either Yes or No depending on whether they are in the same circle of friends. If the answer is Yes, follow the output Yes with a single whitespace and then an integer indicating the friend’s separation.

6
1 2
2 3
3 1
10 11
100 10
11 100
1 100
2 3
0 0

### Sample Output

No
Yes 0

Point Value: 10
Time Limit: 2.00s
Memory Limit: 16M

Problem Types: [Show]

Languages Allowed:
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3

• (0/0)
can i get a hint about why my program RE's?

• (2/0)

hint: if you're passing vector<> instead of vector<>& you're probably doing something wrong

• (0/0)
Thanks! I'll take care of that next time

• (1/1)
for two people to share the same friend, or for a person to have no "incoming" friends?

• (0/0)
Why not?

• (1/1)
There is apparently no such test case.

• (2/0)
what does the distance from each friend mean?

• (3/0)
the one where:

Marc to Fred
Fred to Lori
Lori to Jean
Jean to Marc

see how this forms a circle? to get from marc to lori, we go:

Marc---Fred---Lori

Hence separation of 1, becase you have to go through one intermediate person to get to Lori