B. Chris and Magic Square

B. Chris and Magic Square

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

ZS the Coder and Chris the Baboon arrived at the entrance of Udayland. There is a n × n magic grid on the entrance which is filled with integers. Chris noticed that exactly one of the cells in the grid is empty, and to enter Udayland, they need to fill a positive integer into the empty cell.

Chris tried filling in random numbers but it didn't work. ZS the Coder realizes that they need to fill in a positive integer such that the numbers in the grid form a magic square. This means that he has to fill in a positive integer so that the sum of the numbers in each row of the grid (), each column of the grid (), and the two long diagonals of the grid (the main diagonal —  and the secondary diagonal — ) are equal.

Chris doesn't know what number to fill in. Can you help Chris find the correct positive integer to fill in or determine that it is impossible?

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 500) — the number of rows and columns of the magic grid.

n lines follow, each of them contains n integers. The j-th number in the i-th of them denotes ai, j (1 ≤ ai, j ≤ 109 or ai, j = 0), the number in the i-th row and j-th column of the magic grid. If the corresponding cell is empty, ai, j will be equal to 0. Otherwise, ai, j is positive.

It is guaranteed that there is exactly one pair of integers i, j (1 ≤ i, j ≤ n) such that ai, j = 0.

Output

Output a single integer, the positive integer x (1 ≤ x ≤ 1018) that should be filled in the empty cell so that the whole grid becomes a magic square. If such positive integer x does not exist, output  - 1 instead.

If there are multiple solutions, you may print any of them.

Examples

input

3
4 0 2
3 5 7
8 1 6

output

9

input

4
1 1 1 1
1 1 0 1
1 1 1 1
1 1 1 1

output

1

input

4
1 1 1 1
1 1 0 1
1 1 2 1
1 1 1 1

output

-1

Note

In the first sample case, we can fill in 9 into the empty cell to make the resulting grid a magic square. Indeed,

The sum of numbers in each row is:

4 + 9 + 2 = 3 + 5 + 7 = 8 + 1 + 6 = 15.

The sum of numbers in each column is:

4 + 3 + 8 = 9 + 5 + 1 = 2 + 7 + 6 = 15.

The sum of numbers in the two diagonals is:

4 + 5 + 6 = 2 + 5 + 8 = 15.

In the third sample case, it is impossible to fill a number in the empty square such that the resulting grid is a magic square.

这是一道典型的数学题，如果自己能够独立的做出来，相信你的思维真的是很厉害。

题意：

有一个房间是0，给这个0赋一个值使得每一行和每一列都相等并且两个斜行也是相等的，问存不存在这样一个数，如果存在就输出这个值，如果不存在就输出-1.

这道题有几点要注意的事情

1：当n==1的时候，特判

2：long long 型数组

3：这个可以赋值的这个数必须大于等于0；

感觉到处都是坑，能做出来不容易，好好练思维。

int Map[505][505];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        long long a[505]={0};    // long long 型
        long long b[505]={0};
        int k,m;
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<n;j++)
            {
                scanf("%d",&Map[i][j]);
                if(Map[i][j]==0)
                {
                    k=i,m=j;
                }
            }
        }
      if(n==1)                             / /特判
        printf("1\n");
      else
      {

    //将每一行和每一列的数存起来
        long long  s,l1=0,l2=0;
        for(int i=0;i<n;i++)
        {
            s=0;
            for(int j=0;j<n;j++)
            {
              s+=Map[i][j];
              if(i==j)
                    l1+=Map[i][j];
              if(i+j==n-1)
                   l2+=Map[i][j];
            }
            a[i]=s;
        }


        for(int j=0;j<n;j++)
        {
            s=0;
            for(int i=0;i<n;i++)
            {
                s+=Map[i][j];
            }
            b[j]=s;
        }
       long long s1;
       int flag=0;

//使得每一行和每一列都相等
       for(int i=0;i<n;i++)
       {
            if(i!=k)
            s1=a[i];
       }
       if(s1-a[k]<=0)
         flag=1;
       for(int i=0;i<n;i++)
       {
           if(i!=k&&s1!=a[i])
           {
              flag=1;
               break;
           }
           if(i!=m&&s1!=b[i])
           {
               flag=1;
               break;
           }

          //使得两个斜行都相等的判断
       }
       if(flag==0)
       {
           if((m==k&&m+k==n-1&&l1==l2)||(m!=k&&m+k!=n-1&&l1==l2&&l1==s1))
            printf("%lld\n",s1-a[k]);
         else if((m==k&&m+k!=n-1&&l1==a[k]&&l2==s1)||(m!=k&&m+k==n1&&l2==a[k]&&l1==s1))
            printf("%lld\n",s1-a[k]);
            else
            printf("-1\n");
       }
       else
        printf("-1\n");
      }
    }
}