codeforces 711B. 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 ispositive.

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.

/*
    题意：给你一个n*n的矩阵,矩阵内存在唯一的0,问你能不能把这个数字修改成【正整数】,
          使得矩阵每一行,每一列,两个对角线之和相等.如果可以输出修改以后的值,否则输出-1
    类型：模拟
    分析：找出0的位置,并统计每一行的和与每一列的和,再把0的位置的值修改成【0位置的行与其他行的差值】
          看是否满足矩阵每一行,每一列,两个对角线之和相等,注意该题要求是正整数,也就是在n=1时,不能输出0,
          改为输出任意一个整数即可.
*/
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
typedef long long ll;
ll a[505][505];
ll rsum[505],csum[505];
int main()
{
    int n;
    cin>>n;
    int xx,yy;
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            scanf("%I64d",&a[i][j]);
            if(a[i][j]==0){
                xx=i;
                yy=j;
            }
        }
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            rsum[i]+=a[i][j];
            csum[j]+=a[i][j];
        }
    }
    ll rMin=-1,rMax=-1;
    for(int i=0;i<n;i++){
        if(i==xx){
            rMin=rsum[i];
        }
        if(i!=xx){
            rMax=rsum[i];
        }
    }
    if(n==1){
        cout<<1<<endl;
        return 0;
    }
    if(rMax<rMin){
        cout<<-1<<endl;
        return 0;
    }
    ll res1=rMax-rMin;
    if(res1<=0){
        cout<<-1<<endl;
        return 0;
    }

    a[xx][yy]=res1;

    memset(rsum,0,sizeof(rsum));
    memset(csum,0,sizeof(csum));
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            rsum[j]+=a[i][j];
            csum[i]+=a[i][j];
        }
    }
    for(int i=0;i<n;i++){
        if(rsum[i]!=rMax||csum[i]!=rMax){
            cout<<-1<<endl;
            return 0;
        }
    }
    ll sum1=0,sum2=0;
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(i==j){
                sum1+=a[i][j];
            }
            if(i+j==n-1){
                sum2+=a[i][j];
            }
        }
    }
    if(sum1!=rMax||sum2!=rMax){
        cout<<-1<<endl;
        return 0;
    }
    cout<<res1<<endl;

    return 0;
}