1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 using namespace std;
 5 #define min(a,b) ((a)<(b)?(a):(b))
 6 #define qq 1e9
 7 int read() {
 8     int s=0,f=1;
 9     char ch=getchar();
10     while(ch>‘9‘||ch<‘0‘) {
11         if(ch==‘-‘) {
12             f=-1;
13         }
14         ch=getchar();
15     }
16     while(ch>=‘0‘&&ch<=‘9‘) {
17         s=(s<<1)+(s<<3)+(ch^48);
18         ch=getchar();
19     }
20     return s*f;
21 }
22 int n,r[105],tot,deep[105];
23 int head,tail,queue[105];
24 struct oo {
25     int to,vv,next;
26 } c[10005];
27 void add(int x,int y,int z) {
28     c[tot].to=y;
29     c[tot].next=r[x];
30     c[tot].vv=z;
31     r[x]=tot++;
32 }
33 bool bfs(int s,int t) {
34     memset(deep,0,sizeof(deep));
35     head=tail=0;
36     queue[++tail]=s;
37     deep[s]=1;
38     while(head<tail) {
39         int opt=queue[++head];
40         for(int i=r[opt]; ~i; i=c[i].next) {
41             if(c[i].vv&&!deep[c[i].to]) {
42                 deep[c[i].to]=deep[opt]+1;
43                 queue[++tail]=c[i].to;
44                 if(c[i].to==t) {
45                     return 1;
46                 }
47             }
48         }
49     }
50     return 0;
51 }
52 int dfs(int opt,int fw) {
53     if(opt==n) {
54         return fw;
55     }
56     int tmp=fw,k;
57     for(int i=r[opt]; ~i; i=c[i].next) {
58         if(c[i].vv&&tmp&&deep[c[i].to]==deep[opt]+1) {
59             k=dfs(c[i].to,min(c[i].vv,tmp));
60             if(!k) {
61                 deep[c[i].to]=0;
62                 continue;
63             }
64             c[i].vv-=k;
65             c[i^1].vv+=k;
66             tmp-=k;
67         }
68     }
69     return fw-tmp;
70 }
71 int dicnic(int s,int t){
72     int ans=0;
73     while(bfs(s,t)){
74         ans+=dfs(s,qq);
75     }
76     return ans;
77 }
78 int Main(){
79     freopen("maxflowa.in","r",stdin);
80     freopen("maxflowa.out","w",stdout);
81     n=read();
82     memset(r,-1,sizeof(r));
83     for(int i=1; i<=n; i++) {
84         for(int j=1; j<=n; j++) {
85             int x=read();
86             if(x) {
87                 add(i,j,x);
88                 add(j,i,0);
89             }
90         }
91     }
92     int ans=dicnic(1,n);
93     printf("%d\n",ans);
94     return 0;
95 }
96 int hehe=Main();
97 int main() {
98     ;
99 }