King Byteasar has decided to throw two great parties and wants to invite to them every single
Byteotian inhabitant. Of course he wants to invite each of them to exactly one of the parties.
The king knows from his own vast experience that a person is having a good time
when there is an even number of her/his friends at the party.
Thus he has asked you to divide the country's inhabitants between two parties in a way
that as many people as possible have an even number of friends at their party.
A trivial division, i.e. one that leaves one party with no guests invited, is allowed.
The acquaintanceship is a symmetric relation, i.e. whenever a person *A* knows the person *B*,
the person *B* also knows the person *A*.

- reads from the standard input the number of Byteotia's inhabitants and the description of their acquaintances,
- splits the habitants into two parties in such way that the number of people who have an even number of friends at their party is as large as possible,
- writes to the standard output a list of people who should be invited to the first party.

There are many correct divisions in this task -- your programme should write any one of them.

In the above example everyone will have even number of friends at the party.