#include <bits/stdc++.h>
#include <fstream>
#define cin fin
#define cout fout
#define MAX 1005
using namespace std;
map<pair<int,int>,int>mapp;
vector<int>G[MAX],dead_ends;
int n,prag,nvl[MAX];
bool dead_end[MAX];
int m,i,x,y,z,ras=0;
ifstream cin("maxflow.in");
ofstream cout("maxflow.out");
void nivelare(int nod)
{
    int maxx=0;
    for(int i=1; i<=n; i++)
    {
        nvl[i]=0;
        dead_end[i]=0;
    }
    nvl[nod]=1;
    queue<int>Q;
    Q.push(nod);
    while(!Q.empty())
    {
        nod=Q.front();
        Q.pop();
        for(auto i:G[nod])
        {
            if(nvl[i]==0 && mapp[ {nod,i}]>0)
            {
                maxx=max(maxx,mapp[{nod,i}]);
                nvl[i]=nvl[nod]+1;
                Q.push(i);
            }
        }
    }
    prag=(1<<(int)(log2(maxx)));
}
int dfs(int nod,int minn)
{
    if(nod==n)
        return minn;
    for(auto i:G[nod])
    {
        if(nvl[nod]+1==nvl[i] && mapp[ {nod,i}]>=prag && dead_end[i]==0)
        {
            x=dfs(i,min(minn,mapp[{nod,i}]));
            if(x>0)
            {
                mapp[{nod,i}]-=x;
                mapp[{i,nod}]+=x;
                return x;
            }
            else
            {
                dead_end[i]=1;
                dead_ends.push_back(i);
            }
        }
    }
    return 0;
}
int main()
{
    cin>>n>>m;
    for(i=1; i<=m; i++)
    {
        cin>>x>>y>>z;
        G[x].push_back(y);
        mapp[ {x,y}]=z;
        if(mapp[ {y,x}]==0)
            G[y].push_back(x);
    }
    nivelare(1);
    while(nvl[n]!=0)
    {
        while(prag!=0)
        {
            x=dfs(1,1e9);
            if(x>0)
            {
                ras+=x;
            }
            else
            {
                prag/=2;
                for(auto i:dead_ends)
                {
                    dead_end[i]=0;
                }
                dead_ends.clear();
            }
        }
        nivelare(1);
    }
    cout<<ras;
    return 0;
}