#include<queue>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define inf 0x3f3f3f3f
#define N 220
using namespace std;
int num=1,h[N],level[N],down[N][N],up[N][N],n,S,T,d[N];double mp[N][N];
struct node{
int y,z,next;
}data[N*N];
inline void insert1(int x,int y,int z){
data[++num].y=y;data[num].z=z;data[num].next=h[x];h[x]=num;
data[++num].y=x;data[num].z=0;data[num].next=h[y];h[y]=num;
}
inline bool bfs(int s,int t){
memset(level,0,sizeof(level));queue<int>q;level[s]=1;q.push(s);
while(!q.empty()){
int x=q.front();q.pop();
for (int i=h[x];i;i=data[i].next){
int y=data[i].y,z=data[i].z;
if (level[y]||!z) continue;level[y]=level[x]+1;q.push(y);if (y==t) return 1;
}
}return 0;
}
inline int dfs(int x,int t,int s){
if (x==t) return s;int ss=s;
for (int i=h[x];i;i=data[i].next){
int y=data[i].y,z=data[i].z;
if (level[x]+1==level[y]&&z){
int xx=dfs(y,t,min(s,z));if(!xx) level[y]=0;
s-=xx;data[i].z-=xx;data[i^1].z+=xx;if (!s) return ss;
}
}return ss-s;
}
int s,t;
int main(){
freopen("bzoj3698.in","r",stdin);
scanf("%d",&n);
for (int i=1;i<=n;++i) for (int j=1;j<=n;++j) scanf("%lf",&mp[i][j]),down[i][j]=floor(mp[i][j]),up[i][j]=ceil(mp[i][j]);
s=0;t=n+n+1;S=t+1;T=S+1;
for (int i=1;i<n;++i){
insert1(s,i,up[i][n]-down[i][n]);insert1(n+i,t,up[n][i]-down[n][i]);
d[s]-=down[i][n];d[i]+=down[i][n];d[n+i]-=down[n][i];d[t]+=down[n][i];
}insert1(t,s,inf);
for (int i=1;i<n;++i)
for (int j=1;j<n;++j) insert1(i,j+n,up[i][j]-down[i][j]),d[i]-=down[i][j],d[j+n]+=down[i][j];int sum=0;
for (int i=0;i<=t;++i) {if (d[i]<0) insert1(i,T,-d[i]);if (d[i]>0) insert1(S,i,d[i]),sum+=d[i];}int ans=0;
while(bfs(S,T)) ans+=dfs(S,T,inf);if (ans!=sum) {printf("No");return 0;}ans=0;
while(bfs(s,t)) ans+=dfs(s,t,inf);printf("%d",ans*3);
return 0;
}