SPOJ Problem Set (classical)

1771. Yet Another N-Queen Problem

Problem code: NQUEEN

After solving Solution to the n Queens Puzzle by constructing, LoadingTime wants to solve a harder version of the N-Queen Problem. Some queens have been set on particular locations on the board in this problem. Can you help him??

Input

The input contains multiple test cases. Every line begins with an integer N (N<=50), then N integers followed, representing the column number of the queen in each rows. If the number is 0, it means no queen has been set on this row. You can assume there is at least one solution.

Output

For each test case, print a line consists of N numbers separated by spaces, representing the column number of the queen in each row. If there are more than one answer, print any one of them.

Example

Input:
4 0 0 0 0
8 2 0 0 0 4 0 0 0

Output:
2 4 1 3
2 6 1 7 4 8 3 5

Added by:	Bin Jin
Date:	2007-09-06
Time limit:	5s
Source limit:	10000B
Memory limit:	256MB
Cluster:	Pyramid (Intel Pentium III 733 MHz)
Languages:	All except: C++ 4.0.0-8
Resource:	own problem

hide comments



2012-01-29 10:29:27 zhangyw Just cover n columns... Last edit: 2012-01-29 10:31:26
2011-07-17 05:57:08 Prabhat Chaudhary when do we consider that the input has terminated??
2011-07-17 05:57:08 cherudim It drives me cracy Last edit: 2011-01-25 09:03:49
2011-07-17 05:57:08 DAGA PIYUSH What is the exit condition? Re by Blue Mary: Input terminates by EOF. Last edit: 2010-01-26 08:20:17