OJ系统新功能测试中,如有问题请联系 15864441230 17853533775 15684102985 17853533719 尽量不要在上课时间打电话

Problem 1074. -- You are my brother

1074: You are my brother

Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 30  Solved: 17
[Submit][Status][Web Board]


Little A gets to know a new friend, Little B, recently. One day, they realize that they are family 500 years ago. Now, Little A wants to know whether Little B is his elder, younger or brother.


There are multiple test cases.

For each test case, the first line has a single integer, n (n<=1000). The next n lines have two integers a and b (1<=a,b<=2000) each, indicating b is the father of a. One person has exactly one father, of course. Little A is numbered 1 and Little B is numbered 2.

Proceed to the end of file.


For each test case, if Little B is Little A’s younger, print “You are my younger”. Otherwise, if Little B is Little A’s elder, print “You are my elder”. Otherwise, print “You are my brother”. The output for each test case occupied exactly one line.

Sample Input

1 3
2 4
3 5
4 6
5 6
1 3
2 4
3 5
4 6
5 7
6 7

Sample Output

You are my elder
You are my brother



[Submit][Status][Web Board]