Now, I know everyone doesn't like the English problem, fortunately, yesterday I found my doubi partner created a English problem,and is too difficult.Everyone thought it was my work, o(╯□╰)o，your misunderstood me. 

So now I deleted the original problem , changed to a simple one. I hope you like it, gaga.

      Pay attention: We all know that "fall in love at first sight" this kind of thing, in fact, I think that is the boy(or girl)is very beautiful. A man suffering from a "fall in love at first sight" of the disease. He will fall in love with the girl whom he first met.Now we know that all the date that the boy meet the girls, please output he fall in love with which girl.

        The input consists of several test cases. For each case, the first line contains an integer n,means that,there are n girls(NO.1 to n),Then n lines follow, each contains three positive integers indicate they met.