#include <iostream>
#include <fstream>
#include <queue>
#include <bitset>
#include <vector>

/// drumuri de augmentare
/// Ford Fulkerson algorithm
/// cuplaj maxim in graf bipartit
/// problema harta infoarena
using namespace std;

class parser{
    public:
        parser() {}
        parser(const char *file_name){
            input_file.open(file_name,ios::in | ios::binary);
            input_file.sync_with_stdio(false);
            index=0;
            input_file.read(buffer,SIZE);}
        inline parser &operator >>(int &n){
            for (;buffer[index]<'0' or buffer[index]>'9';inc());
            n=0;
            for (;'0'<=buffer[index] and buffer[index]<='9';inc())
                n=10*n+buffer[index]-'0';
            return *this;}
            ~parser(){
            input_file.close();}
    private:
        fstream input_file;
        static const int SIZE=0x400000;
        char buffer[SIZE];
        int index=0;
        inline void inc(){
            if(++index==SIZE)
                index=0,input_file.read(buffer,SIZE);}
};
 
class writer{
    public:
        writer() {};
        writer(const char *file_name){
            output_file.open(file_name,ios::out | ios::binary);
            output_file.sync_with_stdio(false);
            index=0;}
        inline writer &operator <<(int target){
            aux=0;
            n=target;
            if (!n)
                nr[aux++]='0';
            for (;n;n/=10)
                nr[aux++]=n%10+'0';
            for(;aux;inc())
                buffer[index]=nr[--aux];
            return *this;}
        inline writer &operator <<(const char *target){
            aux=0;
            while (target[aux])
                buffer[index]=target[aux++],inc();
            return *this;}
        ~writer(){
            output_file.write(buffer,index);output_file.close();}
    private:
        fstream output_file;
        static const int SIZE=0x200000;
        int index=0,aux,n;
        char buffer[SIZE],nr[24];
        inline void inc(){
            if(++index==SIZE)
                index=0,output_file.write(buffer,SIZE);}
};

#define NMAX 1010

parser f ("maxflow.in");
writer t ("maxflow.out");

int main() {
    int C[NMAX][NMAX], n, m, total_flow = 0, parent[NMAX];
    bitset<NMAX> vaz;
    vector<int> v[NMAX];

    auto bfs = [&vaz, &v, &C, &parent, &n](int start, int finish) {
        queue<int> q;
        vaz.reset();

        vaz[start] = true;
        q.push(start);

        while (!q.empty()) {
            int current = q.front();
            q.pop();
            
            if (current == n)
                continue;
            
            for (auto i : v[current]) {
                if ((!vaz[i]) && C[current][i] > 0) {
                    vaz[i] = true;
                    parent[i] = current;
                    q.push(i);
                }
            }
        }

        return vaz[finish];
    };

    f >> n >> m;
    total_flow &= 0;
    for (int i = 0, x , y, c; i < m; ++i) {
        f >> x >> y >> c;
        C[x][y] = c;
        C[y][x] = 0;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    
    for (int minflow; bfs(1, n);) {
        for(auto i : v[n]) {
            if (!C[i][n] || !vaz[i])
                continue;
            parent[n] = i;

            minflow = 1e8;
            for (int nod = n; nod != 1; nod = parent[nod])
                minflow = C[parent[nod]][nod] < minflow ? C[parent[nod]][nod] : minflow;

            if (minflow == 0)
                continue;

            for (int nod = n; nod != 1; nod = parent[nod])
                C[parent[nod]][nod] -= minflow,
                C[nod][parent[nod]] += minflow;
            total_flow += minflow;
        }
    }

    t << total_flow;
    return 0;
}