#include <bits/stdc++.h>
using namespace std;
int H, Q;
pair<long long, long long> scale(int i, long long L, long long R) {
  for (; i < H; i++) {
    L = 2 * L + 1;
    R = 2 * R + 2;
  }
  return make_pair(L, R);
}
pair<long long, long long> inter(pair<long long, long long> a,
                                 pair<long long, long long> b) {
  return make_pair(max(a.first, b.first), min(a.second, b.second));
}
pair<long long, long long> unio(pair<long long, long long> a,
                                pair<long long, long long> b) {
  return make_pair(min(a.first, b.first), max(a.second, b.second));
}
set<pair<long long, long long> > ban;
void insert(pair<long long, long long> r) {
  auto it = ban.lower_bound(make_pair(r.first, -1));
  if (it != ban.begin() && prev(it)->second + 1 >= r.first) it--;
  while (it != ban.end()) {
    if (it->second + 1 < r.first || it->first > r.second + 1) break;
    r = unio(r, *it);
    ban.erase(it++);
  }
  ban.insert(r);
}
long long tf = 0;
long long ff = -1;
void extract(pair<long long, long long> ok) {
  auto it = ban.lower_bound(make_pair(ok.first, -1));
  if (it != ban.begin() && prev(it)->second >= ok.first) it--;
  for (auto p : ban)
    while (ok.first <= ok.second && it != ban.end()) {
      if (it->second < ok.first || it->first > ok.second) break;
      if (it->first > ok.first) {
        tf += it->first - ok.first;
        if (ff == -1) ff = ok.first;
      }
      ok.first = it->second + 1;
      it++;
    }
  if (ok.second >= ok.first) {
    tf += ok.second - ok.first + 1;
    if (ff == -1) ff = ok.first;
  }
  if (tf == 1) {
    cout << ff + 1 << endl;
  } else if (tf == 0) {
    cout << "Game cheated!" << endl;
  } else {
    cout << "Data not sufficient!" << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> H >> Q;
  H--;
  pair<long long, long long> ok =
      make_pair((1ll << H) - 1, (1ll << (H + 1)) - 2);
  for (int q = 0; q < Q; q++) {
    long long i, L, R, ans;
    cin >> i >> L >> R >> ans;
    pair<long long, long long> r = scale(i - 1, L - 1, R - 1);
    if (ans)
      ok = inter(ok, r);
    else
      insert(r);
  }
  extract(ok);
}
