These days, you can do all sorts of things online. For example, you can use various
websites to make virtual friends. For some people, growing their social network (their
friends, their friends' friends, their friends' friends' friends, and so on), has become an
addictive hobby. Just as some people collect stamps, other people collect virtual friends.
Your task is to observe the interactions on such a website and keep track of the size of
each person's network. Assume that every friendship is mutual. If Fred is Barney's friend,
then Barney is also Fred's friend.
The first line of input contains a single integer specifying the number of test cases to
follow. Each test case begins with a line containing an integer F, the number of
friendships formed, and 0 < F < 100. Each of the following F lines contains the names of
two people who have just become friends, separated by a space. A name is a continuous
string of 1 to 20 letters (uppercase/lowercase differences do not matter).
For each test case, print "Case n", where n is the test case number. In each test case,
whenever a friendship is formed, print a line containing an integer that indicates the
number of people in the social network of the two people who have just become friends.