#include<iostream>

#include<cstdio>

#include<cmath>

#include<cstdlib>

#include<cstring>

#include<algorithm>

using namespace std;

int read()

{

    int x=,f=;char c=getchar();

    while (c<''||c>'') {if (c=='-') f=-;c=getchar();}

    while (c>=''&&c<='') x=(x<<)+(x<<)+(c^),c=getchar();

    return x*f;

}

#define N 510

#define M 250000

#define inf 2000000000

int n,m,p[N],d[N],t=;

bool flag[N];

struct data{int to,nxt,len,cost;

}edge[M];

void addedge(int x,int y,int z,int c){t++;edge[t].to=y,edge[t].nxt=p[x],edge[t].len=z,edge[t].cost=c,p[x]=t;}

namespace flow

{

    int cur[N],q[N],d[N],ans=;

    struct data{int to,nxt,cap,flow;

    }edge[M];

    void addedge(int x,int y,int z)

    {

        t++;edge[t].to=y,edge[t].nxt=p[x],edge[t].cap=z,edge[t].flow=,p[x]=t;

        t++;edge[t].to=x,edge[t].nxt=p[y],edge[t].cap=,edge[t].flow=,p[y]=t;

    }

    bool bfs()

    {

        memset(d,,sizeof(d));d[]=;

        int head=,tail=;q[]=;

        do

        {

            int x=q[++head];

            for (int i=p[x];~i;i=edge[i].nxt)

            if (d[edge[i].to]==-&&edge[i].flow<edge[i].cap)

            {

                d[edge[i].to]=d[x]+;

                q[++tail]=edge[i].to;

            }

        }while (head<tail);

        return ~d[n];

    }

    int work(int k,int f)

    {

        if (k==n) return f;

        int used=;

        for (int i=cur[k];~i;i=edge[i].nxt)

        if (d[k]+==d[edge[i].to])

        {

            int w=work(edge[i].to,min(f-used,edge[i].cap-edge[i].flow));

            edge[i].flow+=w,edge[i^].flow-=w;

            if (edge[i].flow<edge[i].cap) cur[k]=i;

            used+=w;if (used==f) return f;

        }

        if (used==) d[k]=-;

        return used;

    }

    void dinic()

    {

        while (bfs())

        {

            memcpy(cur,p,sizeof(p));

            ans+=work(,inf);

        }

        cout<<ans;

    }

}

int main()

{

#ifndef ONLINE_JUDGE

    freopen("bzoj1266.in","r",stdin);

    freopen("bzoj1266.out","w",stdout);

    const char LL[]="%I64d\n";

#else

    const char LL[]="%lld\n";

#endif

    n=read(),m=read();

    for (int i=;i<=m;i++)

    {

        int x=read(),y=read(),z=read(),c=read();

        addedge(x,y,z,c);addedge(y,x,z,c);

    }

    memset(d,,sizeof(d));d[]=;

    for (int i=;i<=n;i++)

    {

        int mn=;

        for (int j=;j<=n;j++)

        if (!flag[j]&&d[j]<d[mn]) mn=j;

        flag[mn]=;

        for (int j=p[mn];j;j=edge[j].nxt)

        if (d[mn]+edge[j].len<d[edge[j].to]) d[edge[j].to]=d[mn]+edge[j].len;

    }

    cout<<d[n]<<endl;

    t=-;memset(p,,sizeof(p));

    for (int i=;i<=m;i++)

    {

        if (d[edge[i<<].to]+edge[i<<].len==d[edge[i*-].to])

        flow::addedge(edge[i<<].to,edge[i*-].to,edge[i<<].cost);

        if (d[edge[i*-].to]+edge[i*-].len==d[edge[i<<].to])

        flow::addedge(edge[i*-].to,edge[i<<].to,edge[i<<].cost);

    }

    flow::dinic();

    return ;

}