#include <cstdio>
#include <cstring>
#include <queue>
#define N 300
#define M 100000
#define inf 0x3fffffff
using namespace std;
queue<int> q;
int u[N][N] , v[N][N] , head[N] , to[M] , val[M] , next[M] , cnt = 1 , b , e , s , t , dis[N];
void add(int x , int y , int z)
{to[++cnt] = y , val[cnt] = z , next[cnt] = head[x] , head[x] = cnt;to[++cnt] = x , val[cnt] = 0 , next[cnt] = head[y] , head[y] = cnt;
}
bool bfs()
{int x , i;memset(dis , 0 , sizeof(dis));while(!q.empty()) q.pop();dis[s] = 1 , q.push(s);while(!q.empty()){x = q.front() , q.pop();for(i = head[x] ; i ; i = next[i]){if(val[i] && !dis[to[i]]){dis[to[i]] = dis[x] + 1;if(to[i] == t) return 1;q.push(to[i]);}}}return 0;
}
int dinic(int x , int low)
{if(x == t) return low;int temp = low , i , k;for(i = head[x] ; i ; i = next[i]){if(val[i] && dis[to[i]] == dis[x] + 1){k = dinic(to[i] , min(temp , val[i]));if(!k) dis[to[i]] = 0;val[i] -= k , val[i ^ 1] += k;if(!(temp -= k)) break;}}return low - temp;
}
int main()
{int n , i , j , sum = 0 , ans = 0;double tmp;scanf("%d" , &n) , b = 0 , e = 2 * n - 1 , s = 2 * n , t = 2 * n + 1 , add(e , b , inf);for(i = 1 ; i <= n ; i ++ )for(j = 1 ; j <= n ; j ++ )scanf("%lf" , &tmp) , u[i][j] = (int)tmp , v[i][j] = (tmp > u[i][j]) , sum += u[i][j];for(i = 1 ; i < n ; i ++ ) add(b , i , v[i][n]) , add(s , i , u[i][n]) , add(b , t , u[i][n]);for(i = 1 ; i < n ; i ++ ) add(i + n - 1 , e , v[n][i]) , add(s , e , u[n][i]) , add(i + n - 1 , t , u[n][i]);for(i = 1 ; i < n ; i ++ )for(j = 1 ; j < n ; j ++ )add(i , j + n - 1 , v[i][j]) , add(s , j + n - 1 , u[i][j]) , add(i , t , u[i][j]);while(bfs()) sum -= dinic(s , inf);if(sum){printf("No\n");return 0;}ans = val[3];for(i = head[s] ; i ; i = next[i]) val[i] = val[i ^ 1] = 0;for(i = head[t] ; i ; i = next[i]) val[i] = val[i ^ 1] = 0;val[2] = val[3] = 0 , s = b , t = e;while(bfs()) ans += dinic(s , inf);printf("%d\n" , ans * 3);return 0;
}