Block Game

All submissions for this problem are available.
In the magic land, there is a smart but naughty boy Crane.
Crane has n houses, and n friends (both numbered from 1 to n).
Crane's mother has scheduled a plan for all his friends
such that each friend visits each house of Crane exactly once
at a different time, i.e.,
there is at most one friend in any house at any time.
But like Crane all his friends are also naughty.
Therefore his mother wants to lock away each of his friends in distinct houses.
What she'll do is to choose a distinct house for each friend. As that friend visits
that house, he'll be locked in that house. That is, Crane's mother wants to find a
sequence block such that
the ith friend will be locked in block[i]th house
once he visits that house. As she wants to ensure that there is at maximum one
person in each house, she must choose the sequence block such
that if friend A visits house H at time T, and he is locked away in the house, then no other friends visit house H
after time T.
Help Crane's mother to find such a sequence block.
Input
First line contains a single integer n (1 ≤ n
≤ 100), indicating the number of friends and houses.
Then n lines follow, with each line containing n positive integers.
The jth integer in ith line indicates the time when the ith friend will visit the jth house. All times will fit in signed 32bit integer.
Output
If there exists a sequence block that satisfies the constraints, then output block[1] block[2] ... block[n] in one line, separated by a single space.
Otherwise if there is no such sequence, output 1 in one line.
If there are multiple answers, then anyone will do.
Example
Input: 3 1 2 3 4 5 6 7 8 9 Output: 3 2 1
Author:  shangjingbo 
Tester:  laycurse 
Editorial  http://discuss.codechef.com/problems/BLOCKING 
Tags  aug12, graph, matching, shangjingbo 
Date Added:  26062012 
Time Limit:  0.184358 sec 
Source Limit:  50000 Bytes 
Languages:  C, CPP14, JAVA, PYTH, PYTH 3.5, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, PERL6, TEXT, CLOJ, FS 
Comments
 Please login at the top to post a comment.
SUCCESSFUL SUBMISSIONS
Fetching successful submissions
HELP
If you are still having problems, see a sample solution here. 