|
||||||||
Time Limit: 1.0 second Memory Limit: 4 000 KB Tyomitch plays the following game with N of his friends. Tyomitch leaves the room. His friends write numbers from 1 to N on cards, and each of the friends takes a card in a way that Tyomitch doesn't know which card each one has. Let's number the friends from 1 to N. After Tyomitch comes back to the room, each of his friends makes 2 statements of the following form (examples given for i'th friend):
InputThe first line of the input contains the number N (2 ≤ N ≤ 1000). Each of the following N lines contains a triple ai, bi, ci - the statements of Tyomitch's friends. OutputThe only line of output must contain N numbers separated with spaces, being the numbers of the true statement (either 1 or 2) for each of the friends. It is known that a solution exists. Sample Input5 3 4 3 1 3 2 3 2 5 2 5 4 3 4 1 Sample Output1 2 2 2 2 Problem Author: Alexander Ipatov & Dmitry Ivankov Problem Source: Petrozavodsk summer training camp, August 2005. Print Statistic Discuss Submit |
||||||||
|