#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;

const int N = 1024;

int cap[N][N], pred[N], q[N];

vector<int> vec[N];

void BFS(int s, int t) {
    int start = 0, avans = 0;
    q[avans++] = s;
    pred[s] = -2;
    while (avans > start && pred[t] == -1)
        for (int u = q[start++], i = 0, v; i < vec[u].size(); i++) {
            v = vec[u][i];
            if (pred[v] == -1 && cap[u][v])
                q[avans++] = v, pred[v] = u;
        }
}

int dinic(int n, int s, int t) {
    int flow = 0;
    while (1) {
        memset(pred, -1, sizeof(pred));
        BFS(s, t);
        if (pred[t] == -1) break;
        for (int z = 1; z <= n; z++)
            if (cap[z][t] && pred[z] != -1) {
                int capmin = cap[z][t];
                for (int v = z, u = pred[v]; u > 0; v = u, u = pred[v])
                    capmin  = min(capmin, cap[u][v]);
                if (!capmin) continue;
                cap[z][t] -= capmin, cap[t][z] += capmin;
                for (int v = z, u = pred[v]; u >= 0; v = u, u = pred[v])
                    cap[u][v] -= capmin,  cap[v][u] += capmin;
                flow += capmin;
            }
    }
    return flow;
}

int main() {
    FILE *in = fopen("maxflow.in", "r"), *out = fopen("maxflow.out", "w");
    if (in && out){
        int n, s, t, m;
        fscanf(in, "%d %d", &n, &m);
        s = 1, t = n;
        for(int i = 0; i < m; i++) {
            int u, v, c;
            fscanf(in, "%d %d %d", &u, &v, &c);
            cap[u][v] += c;
            vec[u].push_back(v);
            vec[v].push_back(u);
        }
        fprintf(out, "%d\n", dinic(n, s, t));
        fclose(in), fclose(out);
    }
    return 0;
}