#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  long long ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
pair<long long, long long> pp[2][100001];
vector<pair<long long, long long> > vc;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long h, q;
  cin >> h >> q;
  int c1 = 0, c2 = 0;
  while (q--) {
    long long lvl, l, r, ans;
    cin >> lvl >> l >> r >> ans;
    for (int j = lvl + 1; j <= h; j++) {
      l *= 2ll;
      r = (r * 2ll + 1ll);
    }
    if (ans == 0) {
      pp[ans][c1++] = make_pair(l, r);
    } else {
      pp[ans][c2++] = make_pair(l, r);
    }
  }
  long long l = 1, r = 1, mx, mn;
  for (int i = 2; i <= h; i++) {
    l *= 2ll;
    r = (r * 2ll + 1ll);
  }
  mx = r;
  mn = l;
  for (int i = (0); i < (c2); ++i) {
    if (pp[1][i].first > r || pp[1][i].second < l) {
      cout << "Game cheated!" << endl;
      return 0;
    }
    l = max(l, pp[1][i].first);
    r = min(r, pp[1][i].second);
  }
  sort(pp[0], pp[0] + c1);
  long long rgt = l - 1;
  for (int i = (0); i < (c1); ++i) {
    if (pp[0][i].second <= rgt) continue;
    if (pp[0][i].first > rgt + 1) {
      vc.push_back(make_pair(rgt + 1, pp[0][i].first - 1));
    }
    rgt = max(rgt, pp[0][i].second);
  }
  if (rgt < mx) vc.push_back(make_pair(rgt + 1, mx));
  long long sum = 0, last = 0;
  for (int i = (0); i < (vc.size()); ++i) {
    if (vc[i].first > r || vc[i].second < l) continue;
    long long pl = max(l, vc[i].first);
    long long pr = min(r, vc[i].second);
    sum += pr - pl + 1;
    last = pl;
  }
  if (sum == 0) {
    cout << "Game cheated!" << endl;
    return 0;
  }
  if (sum == 1) {
    cout << last << endl;
  } else {
    cout << "Data not sufficient!" << endl;
  }
}
