You are my brother

Description

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.

Input

         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.           

Output

         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

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

Sample Output

You are my elder
You are my brother

#include<stdio.h>
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        int i,j;
        int a,b;
        a=1;
        b=2;
        int count1,count2;
        count1=count2=0;
        for(int k=0;k<n;k++)
        {
           scanf("%d%d",&i,&j);
            if(a!=b)
            {
                if(i==a)
                {
                a=j;
                count1++;
                }
            if(i==b)
            {
                b=j;
                count2++;
            }
            }

        }
        if(count1>count2)
            printf("You are my elder\n");
            if(count1==count2)
            printf("You are my brother\n");
            if(count1<count2)
            printf("You are my younger\n");
    }
    return 0;
}