OpenJudge

D:Sudoku Checker

总时间限制:
2000ms
内存限制:
65536kB
描述

The puzzle game of Sudoku is played on a board of N2 × N2 cells. The cells are grouped in N × N squares of N × N cells each. Each cell is either empty or contains a number between 1 and N2.

The sudoku position is correct when numbers in each row, each column and each square are different. The goal of the game is, starting from some correct position, fill all empty cells so that the final position is still correct.

This game is fairly popular in the Internet, and there are many sites which allow visitors to solve puzzles online. Such sites always have a subroutine to determine a correctness of a given position.

You are to write such a routin.

输入

Input file contains integer N, followed by N4 integers — sudoku position. Empty cells are denoted by zeroes.

Constraints

1 ≤ N ≤ 10.

输出

Output file must contain a single string 'CORRECT' or 'INCORRECT'.
 

样例输入
Sample input 1
2
0 0 0 0
0 0 0 0
0 0 2 0
0 0 0 1
Sample input 2
2
2 1 3 0
3 2 4 0
1 3 2 4
0 0 0 1
样例输出
Sample output 1
CORRECT
Sample output 2
INCORRECT
提示
Bold texts appearing in the sample sections are informative and do not form part of the actual data.
来源
Northeastern Europe 2005, Far-Eastern Subregion
全局题号
2187
提交次数
110
尝试人数
54
通过人数
36