A horticultural research campus tracks every climate-controlled panel on its greenhouse wall using a grid of catalog tags. The wall is arranged as an n x n grid, and by design it should carry every integer from 1 to n^2 exactly once: one catalog number per panel, no repeats, no gaps. A stamping-machine malfunction duplicated one catalog number onto two different panels and, as a result, skipped another number entirely so that no panel bears it. Given the n x n grid of catalog numbers, determine which number was stamped twice and which number was never stamped.

Input format

• Line 1: a single integer n.
• Each of the next n lines contains n space-separated integers: row i of the panel grid.

Output format

Print two space-separated integers: the catalog number that appears twice, followed by the catalog number that never appears.

Constraints

• 2 <= n <= 50
• Every grid value is between 1 and n^2 (inclusive).
• Exactly one integer in [1, n^2] appears exactly twice in the grid, exactly one integer in [1, n^2] appears zero times, and every other integer in [1, n^2] appears exactly once.

2
1 3
2 2

2 4

3
9 1 7
8 9 2
3 4 6

9 5