You are given a square matrix of natural numbers of order . Select elements from this matrix such that:
Each row and each column contains exactly one selected element.
Among all such selections, the sum of the selected numbers is minimized.
If there are multiple selections that satisfy these conditions, you may output any of them.
The first line contains a natural number (1 \leq n \leq 200). Each of the following lines contains numbers. Each matrix element does not exceed .
On the first line, output the minimum possible sum of the selected numbers. On the second line, output numbers: the -th number in this sequence should indicate the column number where the selected element is located in the -th row. This sequence should be a permutation of the numbers from to .
Example 1