In the event of technical difficulties with Szkopuł, please contact us via email at firstname.lastname@example.org.
If you are familiar with IRC chat, the support team is also reachable on PIRC network (
#szkopul channel. If you are not, just use email.
Please do not ask us things like "how to solve task XYZ?".
Please remember that the support team has to sleep sometimes or go to work in real life.
Every member of Byteland Credit Society is entitled to loan any amount of Bytelandish ducats unless it is or more, but he has to return the whole amount within seven days. There are ATMs in the Client Service Room of the Society. They are numbered from to . Every ATM can perform one action only: it can pay or receive a fixed amount. The -th ATM pays ducats if is even or it receives ducats if is odd. If a client is going to loan a fixed sum of money it is necessary to check if he is able to get the money using every ATM at most once. If so, numbers of ATMs he has to use should be determined. It is also necessary to check if the client can return the money in a similar way, and if so, to determine numbers of ATMs he has to use.
A client who is going to loan ducats gets ducats from the ATM No and ducat from the ATM No and then he returns ducats in the ATM No and ducats in the ATM No . In order to return the amount of ducats he receives ducat from the ATM No and then he returns ducats in ATM No .
Write a program that:
In the first line of the standard input there is one positive integer , which equals the number of clients. In each of the following lines there is one positive integer less than (at most decimal digits). The number in the -th line describes the amount which the client is going to loan.
In each of lines of the standard output there should be written a decreasing sequence of positive integers from the range separated by single spaces, or one word NIE (which means “no” in Polish):
For the input data:
2 7 633825300114114700748351602698
the correct result is:
4 3 1 0 3 0 NIE 99 3 1
Task author: Piotr Chrzastowski-Wachtel.