#include <iostream>
#include <vector>
#include <queue>
#include <fstream>
#include <algorithm>
using namespace std;

const int nmax = 1001;
const int INF = 1e9;

struct Edge {
    int to, cap, flow, rev;
};

vector<Edge> adj[nmax];

void addEdge(int u, int v, int cap) {
    Edge a = {v, cap, 0, (int)adj[v].size()};
    Edge b = {u, 0, 0, (int)adj[u].size()};
    adj[u].push_back(a);
    adj[v].push_back(b);
}

int level[nmax], start[nmax];

bool bfs(int s, int t, int n) {
    for (int i = 0; i <= n; i++) {
        level[i] = -1;
    }
    level[s] = 0;
    queue<int> q;
    q.push(s);
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        for (Edge &e : adj[u]) {
            if (level[e.to] < 0 && e.flow < e.cap) {
                level[e.to] = level[u] + 1;
                q.push(e.to);
            }
        }
    }
    return level[t] >= 0;
}

int dfs(int u, int t, int flow) {
    if (u == t)
        return flow;
    for (int &i = start[u]; i < adj[u].size(); i++) {
        Edge &e = adj[u][i];
        if (level[e.to] == level[u] + 1 && e.flow < e.cap) {
            int curr_flow = min(flow, e.cap - e.flow);
            int temp_flow = dfs(e.to, t, curr_flow);
            if (temp_flow > 0) {
                e.flow += temp_flow;
                adj[e.to][e.rev].flow -= temp_flow;
                return temp_flow;
            }
        }
    }
    return 0;
}

int dinic(int s, int t, int n) {
    int max_flow = 0;
    while (bfs(s, t, n)) {
        for (int i = 0; i <= n; i++) {
            start[i] = 0;
        }
        while (int flow = dfs(s, t, INF)) {
            max_flow += flow;
        }
    }
    return max_flow;
}

int main() {
    ifstream fin("maxflow.in");
    ofstream fout("maxflow.out");

    int n, m, u, v, c;
    fin >> n >> m;

    for (int i = 0; i < m; i++) {
        fin >> u >> v >> c;
        addEdge(u, v, c);
    }

    int ans = dinic(1, n, n);
    fout << ans << "\n";

    return 0;
}