#include <bits/stdc++.h>
using namespace std;
const int N = 100000 + 5;
const int mod = 998244353;
const int inf = 1e9;
set<pair<long long, long long> > v1, v2, v3;
int n, q;
int main() {
  scanf("%d%d", &n, &q);
  long long L = 1ll << (n - 1), R = (1ll << n) - 1;
  long long t, l, r, ans;
  while (q--) {
    scanf("%I64d%I64d%I64d%I64d", &t, &l, &r, &ans);
    for (int i = t; i < n; i++) {
      l = l << 1;
      r = r << 1 | 1;
    }
    if (ans)
      v1.insert(make_pair(l, r));
    else
      v2.insert(make_pair(l, r));
  }
  set<pair<long long, long long> >::iterator i, j;
  l = L, r = R;
  for (i = v2.begin(); i != v2.end(); i++) {
    if (i->first > l) {
      v3.insert(make_pair(l, i->first - 1));
    }
    l = max(l, i->second + 1);
  }
  if (l <= r) v3.insert(make_pair(l, r));
  for (i = v1.begin(); i != v1.end(); i++) {
    if (i->first > R) {
      puts("Game cheated!");
      return 0;
    }
    L = i->first;
    R = min(R, i->second);
  }
  long long ret = 0, op = -1;
  for (i = v3.begin(); i != v3.end(); i++) {
    if (i->second >= L && i->first <= R) {
      ret += min(i->second, R) - max(L, i->first) + 1;
      op = min(i->second, R);
    }
  }
  if (ret == 1)
    printf("%I64d\n", op);
  else if (ret > 1)
    puts("Data not sufficient!");
  else
    puts("Game cheated!");
  return 0;
}
