#include<bits/stdc++.h>

using namespace std;
typedef long long ll;

#define N 1010

ll n, m;
ll a[N][N], s[N][N];
ll w[N];

int main()
{
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n;
    for (int i = 1; i <= n; i ++)
    {
        for (int j = 1; j <= n; j ++)
        {
            cin >> a[i][j];
        }
    }
    for (int i = 1; i <= n; i ++)
    {
        w[i] = a[i][1];
        for (int j = 1; j <= n; j ++)
        {
            a[i][j] -= w[i];
        }
    }
    for (int j = 2; j <= n; j ++)
    {
        ll mx = 0;
        for (int i = 1; i <= n; i ++)
        {
            mx = max(mx, a[i][j]);
        }
        for (int i = 1; i <= n; i ++)a[i][j] = mx;
    }
    for (int i = 1; i <= n; i ++)
    {
        for (int j = 1; j <= n; j ++)a[i][j] += w[i];
    }
    ll ans = 0;
    for (int i = 1; i <= n; i ++) for (int j = 1; j <= n; j ++) ans += a[i][j];
    cout << ans << '\n';
    for (int i = 1; i <= n; i ++)
    {
        for (int j = 1; j <= n; j ++) cout << a[i][j] << ' ';
        cout << '\n';
    }
    return 0;
}