Problem: A smile house is created to raise the mood. It has n rooms. Some of the rooms are connected by doors. For each two rooms (number i and j), which are connected by a door, Petya knows their value cij — the value which is being added to his mood when he moves from room i to room j.

Petya wondered whether he can raise his mood infinitely, moving along some cycle? And if he can, then what minimum number of rooms he will need to visit during one period of a cycle?

Input

The first line contains two positive integers n and m (<image>), where n is the number of rooms, and m is the number of doors in the Smile House. Then follows the description of the doors: m lines each containing four integers i, j, cij и cji (1 ≤ i, j ≤ n, i ≠ j, - 104 ≤ cij, cji ≤ 104). It is guaranteed that no more than one door connects any two rooms. No door connects the room with itself.

Output

Print the minimum number of rooms that one needs to visit during one traverse of the cycle that can raise mood infinitely. If such cycle does not exist, print number 0.

Examples

Input

4 4
1 2 -10 3
1 3 1 -10
2 4 -10 -1
3 4 0 -3


Output

4

Note

Cycle is such a sequence of rooms a1, a2, ..., ak, that a1 is connected with a2, a2 is connected with a3, ..., ak - 1 is connected with ak, ak is connected with a1. Some elements of the sequence can coincide, that is, the cycle should not necessarily be simple. The number of rooms in the cycle is considered as k, the sequence's length. Note that the minimum possible length equals two.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
struct Node {
  int vfMpos, vcMpos;
  int vfLpos, vcLpos;
  double vfMax, vcMax;
  double vfLax, vcLax;
  inline Node() {
    vfMpos = vcMpos = vfLpos = vcLpos = vfMax = vcMax = vfLax = vcLax = 0;
  }
};
struct Seg {
  Node t[1 << 2];
  inline Node Merge(Node tl, Node tr) {
    Node t;
    if (tl.vfMax > tr.vfMax) {
      t.vfMax = tl.vfMax;
      t.vfMpos = tl.vfMpos;
      if (tl.vfLax > tr.vfMax)
        t.vfLax = tl.vfLax, t.vfLpos = tl.vfLpos;
      else
        t.vfLax = tr.vfMax, t.vfLpos = tr.vfMpos;
    } else {
      t.vfMax = tr.vfMax;
      t.vfMpos = tr.vfMpos;
      if (tr.vfLax > tl.vfMax)
        t.vfLax = tr.vfLax, t.vfLpos = tr.vfLpos;
      else
        t.vfLax = tl.vfMax, t.vfLpos = tl.vfMpos;
    }
    if (tl.vcMax > tr.vcMax) {
      t.vcMax = tl.vcMax;
      t.vcMpos = tl.vcMpos;
      if (tl.vcLax > tr.vcMax)
        t.vcLax = tl.vcLax, t.vcLpos = tl.vcLpos;
      else
        t.vcLax = tr.vcMax, t.vcLpos = tr.vcMpos;
    } else {
      t.vcMax = tr.vcMax;
      t.vcMpos = tr.vcMpos;
      if (tr.vcLax > tl.vcMax)
        t.vcLax = tr.vcLax, t.vcLpos = tr.vcLpos;
      else
        t.vcLax = tl.vcMax, t.vcLpos = tl.vcMpos;
    }
    return t;
  }
  void Build(int l, int r, int now) {
    if (l == r) {
      return;
    }
    int mid = (l + r) >> 1;
    Build(l, mid, (now << 1));
    Build(mid + 1, r, (now << 1 | 1));
    t[now] = Merge(t[(now << 1)], t[(now << 1 | 1)]);
  }
  Node qry(int L, int R, int l, int r, int now) {
    if (l == L && r == R) return t[now];
    int mid = (l + r) >> 1;
    if (mid >= R) return qry(L, R, l, mid, (now << 1));
    if (mid < L)
      return qry(L, R, mid + 1, r, (now << 1 | 1));
    else {
      Node tl = qry(L, mid, l, mid, (now << 1));
      Node tr = qry(mid + 1, R, mid + 1, r, (now << 1 | 1));
      return Merge(tl, tr);
    }
  }
} T;
const int oo = 0x3f3f3f3f;
int f[10][310][310], ans[2][310][310], n;
bool ok(int x) {
  int k, now = 0, i, j, p;
  for (i = 1; i <= n; i++)
    for (j = 1; j <= n; j++) ans[0][i][j] = i == j ? 0 : -oo;
  for (k = 0; (1 << k) <= x; k++)
    if (x & (1 << k)) {
      now ^= 1;
      for (i = 1; i <= n; i++)
        for (j = 1; j <= n; j++) ans[now][i][j] = -oo;
      for (i = 1; i <= n; i++)
        for (j = 1; j <= n; j++)
          for (p = 1; p <= n; p++)
            ans[now][i][j] =
                max(ans[now][i][j], ans[now ^ 1][i][p] + f[k][p][j]);
    }
  for (i = 1; i <= n; i++)
    if (ans[now][i][i] > 0) return 1;
  return 0;
}
int main() {
  int i, j, k, m, p, q, x, y, z, w, l, r, mid;
  scanf("%d%d", &n, &m);
  for (k = 0; (1 << k) <= n; k++)
    for (i = 1; i <= n; i++)
      for (j = 1; j <= n; j++) f[k][i][j] = i == j ? 0 : -oo;
  for (i = 1; i <= m; i++) {
    scanf("%d%d%d%d", &x, &y, &z, &w);
    f[0][x][y] = z;
    f[0][y][x] = w;
  }
  for (k = 1; (1 << k) <= n; k++)
    for (i = 1; i <= n; i++)
      for (j = 1; j <= n; j++)
        for (x = 1; x <= n; x++)
          f[k][i][j] = max(f[k][i][j], f[k - 1][i][x] + f[k - 1][x][j]);
  l = 2;
  r = n + 1;
  while (l < r) {
    mid = (l + r) / 2;
    if (ok(mid))
      r = mid;
    else
      l = mid + 1;
  }
  printf("%d\n", l % (n + 1));
}