#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define pb push_back
#define fi first
#define se second
#define sz(x) x.size()
#define lowbit(x) (x & (-x))
#define all(x) x.begin(), x.end()
#define inf 0x3f3f3f3f3f3f3f3f
#define int long long
#define pai 3.14
#define QF ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define c1 cout << 1
#define c2 cout << 2
// #define width cout << ""
using ll = long long;
using PII = pair<int, int>;
using LD = long double;

mt19937_64 rnd(chrono::duration_cast<chrono::nanoseconds>(chrono::system_clock::now().time_since_epoch()).count());
constexpr int N = 1e3 + 10;
int a[N][N], row[N], col[N], b[N][N], c[N][N];
void solve()
{
    int n;
    cin >> n;
    int rows, cols;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            cin >> a[i][j];
            b[i][j] = a[i][j];
            c[i][j] = a[i][j];
            if (a[i][j] == -1)
            {
                rows = i;
                cols = j;
            }
        }
    }
    int qrows = rows - 1;
    if (rows == 1)
    {
        qrows += 2;
    }
    int mcols = 0, mrows = 0;
    for (int i = 1; i <= n; i++)
    {
        if (i == cols)
            continue;
        int mi = inf;
        for (int j = 1; j <= n; j++)
        {
            mi = min(mi, a[j][i]);
        }

        for (int j = 1; j <= n; j++)
        {
            b[j][i] -= mi;
        }
    }
    int qcols = cols - 1;
    if (cols == 1)
    {
        qcols += 2;
    }
    for (int i = 1; i <= n; i++)
    {
        if (i == rows)
            continue;
        int mi = inf;
        for (int j = 1; j <= n; j++)
        {
            mi = min(mi, a[i][j]);
        }
        for (int j = 1; j <= n; j++)
        {
            c[i][j] -= mi;
        }
    }
    int mi = inf;
    for (int i = 1; i <= n; i++)
    {
        if (i == cols)
            continue;
        mi = min(b[qrows][i], mi);
    }
    for (int i = 1; i <= n; i++)
    {
        b[qrows][i] -= mi;
    }
    mi = inf;
    for (int i = 1; i <= n; i++)
    {
        if (i == rows)
            continue;
        mi = min(c[i][qcols], mi);
    }
    for (int i = 1; i <= n; i++)
    {
        c[i][qcols] -= mi;
    }
    cout << b[qrows][cols] + c[rows][qcols] << endl;
}
signed main()
{
    QF;
    int T = 1;
    // cin >> T;
    for (int i = 1; i <= T; i++)
    {
        solve();
        // cout << endl;
    }
}