提示: 欢迎访问OurACM平台。
Problem 1301 Matrix

Accept: 141    Submit: 309
Time Limit: 1000 mSec    Memory Limit : 32768 KB

Problem Description

Given an n*n matrix A, whose entries A(i,j) are integer numbers (0<=i<n, 0<=j<n). An operation SHIFT at row i (0<=i<n) will move the integers in the row one position right, and the rightmost integer will wrap around to the leftmost column.

You can do the SHIFT operation at arbitrary row, and as many times as you like. Your task is to minimize

Input

The input consists of several test cases. The first line of each test case contains an integer n. Each of the following n lines contains n integers, indicating the matrix A. The input is terminated by a single line with an integer -1. You may assume that 1<=n<=7 and |A(i,j)|<10^4.

Output

For each test case, print a line containing the minimum value of the maximum of column sums.

Sample Input

2 4 6 3 7 3 1 2 3 4 5 6 7 8 9 -1

Sample Output

11 15

Source

Shanghai2004 Preliminary

Submit  Back  Status  Discuss