EQDIV  Equidivisions
An equidivision of an n × n square array of cells is a partition of the n^2 cells in the array in exactly n sets, each one with n contiguous cells. Two cells are contiguous when they have a common side.
A good equidivision is composed of contiguous regions. The figures show a good and a wrong equidivision for a 5×5 square:
Note that in the second example the cells labeled with 4 describe three noncontiguous regions and cells labeled with 5 describe two noncontiguous regions. You must write a program that evaluates if an equidivision of the cells in a square array is good or not.
Input
It is understood that a cell in an n×n square array is denoted by a pair (i, j), with 1 <= i, j <= n. The input file contains several test cases. Each test case begins with a line indicating n, 0 < n < 100, the side of the square array to be partitioned. Next, there are n − 1 lines, each one corresponding to one partition of the cells of the square, with some nonnegative integer numbers.
Consecutive integers in a line are separated with a single blank character. A line of the form
means that cells denoted with the pairs (a1, a2), (a3, a4), ... belong to one of the areas in the partition. The last area in the partition is defined by those cells not mentioned in the n − 1 given lines. If a case begins with n = 0 it means that there are no more cases to analyze.
Output
For each test case good must be printed if the equidivision is good, in other case, wrong must be printed. The answers for the different cases must preserve the order of the input.
Example
Input: 2 1 2 2 1 5 1 1 1 2 1 3 3 2 2 2 2 1 4 2 4 1 5 1 3 1 4 5 5 2 5 3 5 5 5 4 2 5 3 4 3 5 4 3 4 4 5 1 1 1 2 1 3 3 2 2 2 2 1 3 1 4 1 5 1 4 2 4 5 5 2 5 3 5 5 5 4 2 4 1 4 3 5 4 3 4 4 0 Output: wrong good wrong
hide comments
:D:
20090717 18:59:04
There are some extra numbers in the input that should be ignored. Read only 2n first numbers from every line describing aera's and ignore the rest to '\n' sing. 

Divyanshu Ranjan:
20090701 09:07:15
something is wrong with input 
Added by:  Camilo Andrés Varela León 
Date:  20061025 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  XX Colombian National Programming ACM 2006 