3431 -- Texture Tile

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

Language:

Texture Tile

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 1742		Accepted: 410		Special Judge

Description

Square raster image is represented by an array of N × N pixels. A texture tile is a square image in which the first row is equal to the last one, and the first column is equal to the last one. This property is valuable when covering the surface of graphics object with repeating copies of texture, because it allows "seamless" transitions between tiles.

Your program must, given an image, find its largest subimage which is a texture tile.

Input

Input file contains integer N followed by N² numbers c_{i, j} — pixel values.

Constraints

1 ≤ N ≤ 370, 0 ≤ c_{i, j} ≤ 255.

Output

Output file must contain numbers p q m — coordinates of top left corner and size of the largest texture tile. If several solutions exist, output any of them.

Sample Input

Sample input 1
2
0 0
2 3
Sample input 2
4
1 0 0 0
1 2 5 2
1 0 0 0
4 4 4 4

Sample Output

Sample output 1
1 1 1
Sample output 2
1 2 3

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

[Submit] [Go Back] [Status] [Discuss]

Home Page Go Back To top