#include <queue>

 #include <cstdio>

 #include <cstring>

 #include <iostream>

 #define N 1000001

 #define min(x, y) ((x) < (y) ? (x) : (y))

 int n, cnt, s, t;

 int a[][], dis[N], pre[N];

 int head[N], to[N << ], val[N << ], cost[N << ], next[N << ];

 bool vis[N];

 inline int read()

 {

     int x = , f = ;

     char ch = getchar();

     for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = -;

     for(; isdigit(ch); ch = getchar()) x = (x << ) + (x << ) + ch - '';

     return x * f;

 }

 inline void add(int x, int y, int z, int c)

 {

     to[cnt] = y;

     val[cnt] = z;

     cost[cnt] = c;

     next[cnt] = head[x];

     head[x] = cnt++;

 }

 inline bool spfa()

 {

     int i, u, v;

     std::queue <int> q;

     memset(vis, , sizeof(vis));

     memset(pre, -, sizeof(pre));

     memset(dis,  / , sizeof(dis));

     q.push(s);

     dis[s] = ;

     while(!q.empty())

     {

         u = q.front(), q.pop();

         vis[u] = ;

         for(i = head[u]; i ^ -; i = next[i])

         {

             v = to[i];

             if(val[i] && dis[v] > dis[u] + cost[i])

             {

                 dis[v] = dis[u] + cost[i];

                 pre[v] = i;

                 if(!vis[v])

                 {

                     q.push(v);

                     vis[v] = ;

                 }

             }

         }

     }

     return pre[t] ^ -;

 }

 inline int dinic()

 {

     int i, d, sum = ;

     while(spfa())

     {

         d = 1e9;

         for(i = pre[t]; i ^ -; i = pre[to[i ^ ]]) d = min(d, val[i]);

         for(i = pre[t]; i ^ -; i = pre[to[i ^ ]])

         {

             val[i] -= d;

             val[i ^ ] += d;

         }

         sum += dis[t] * d;

     }

     return sum;

 }

 int main()

 {

     int i, j, x;

     n = read();

     s = , t = n + n + ;

     memset(head, -, sizeof(head));

     for(i = ; i <= n; i++)

     {

         add(s, i, , );

         add(i, s, , );

         add(i + n, t, , );

         add(t, i + n, , );

         for(j = ; j <= n; j++)

         {

             a[i][j] = read();

             add(i, j + n, , a[i][j]);

             add(j + n, i, , -a[i][j]);

         }

     }

     printf("%d\n", dinic());

     cnt = ;

     memset(head, -, sizeof(head));

     for(i = ; i <= n; i++)

     {

         add(s, i, , );

         add(i, s, , );

         add(i + n, t, , );

         add(t, i + n, , );

         for(j = ; j <= n; j++)

         {

             add(i, j + n, , -a[i][j]);

             add(j + n, i, , a[i][j]);

         }

     }

     printf("%d\n", -dinic());

     return ;

 }