3435 -- Sudoku Checker

Language:

Sudoku Checker

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 1973		Accepted: 870

Description

The puzzle game of Sudoku is played on a board of N² × N² 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 N².

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

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

Constraints

1 ≤ N ≤ 10.

Output

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

Sample Input

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

Sample output 1
CORRECT
Sample output 2
INCORRECT

Hint

Bold texts appearing in the sample sections are informative and do not form part of the actual data.

Source

Northeastern Europe 2005, Far-Eastern Subregion