#include <bits/stdc++.h>
using namespace std;
signed long long int tree[700000 + 5];
signed long long int read(int idx) {
  signed long long int sum = 0;
  while (idx <= 700000) {
    sum += tree[idx];
    idx += (idx & -idx);
  }
  return sum;
}
void update(int idx, int val) {
  if (idx == 0) return;
  while (idx > 0) {
    tree[idx] += val;
    idx -= (idx & -idx);
  }
}
vector<pair<pair<int, int>, pair<signed long long int, signed long long int> > >
    Q;
map<signed long long int, int> mp;
map<int, signed long long int> rmp;
signed long long int p[654];
int H;
signed long long int tell_left(signed long long int x, int level) {
  while (level < H) {
    level++;
    x *= 2;
  }
  return x;
}
signed long long int tell_right(signed long long int x, int level) {
  while (level < H) {
    level++;
    x *= 2;
    x++;
  }
  return x;
}
int main() {
  vector<signed long long int> v;
  int q, x, a;
  signed long long int L, R;
  p[0] = 1;
  for (int i = 1; i <= 60; ++i) p[i] = p[i - 1] * 2;
  cin >> H >> q;
  v.push_back(p[H - 1]);
  v.push_back(p[H] - 1);
  for (int i = 1; i <= q; ++i) {
    scanf("%d", &x);
    scanf("%lld", &L);
    L = tell_left(L, x);
    scanf("%lld", &R);
    R = tell_right(R, x);
    scanf("%d", &a);
    v.push_back(L);
    v.push_back(L - 1);
    v.push_back(L + 1);
    v.push_back(R + 1);
    v.push_back(R);
    v.push_back(R - 1);
    Q.push_back(make_pair(make_pair(x, a), make_pair(L, R)));
  }
  sort(v.begin(), v.end());
  int N = 0;
  for (int i = 0; i < v.size(); ++i) {
    if (v[i] >= p[H] or v[i] < p[H - 1]) continue;
    if (mp[v[i]] == 0) mp[v[i]] = ++N;
    rmp[mp[v[i]]] = v[i];
  }
  update(N, 1);
  for (int i = 0; i < Q.size(); ++i) {
    x = Q[i].first.first;
    a = Q[i].first.second;
    L = Q[i].second.first;
    L = mp[L];
    R = Q[i].second.second;
    R = mp[R];
    if (a == 0) {
      update(R, -1000000007);
      update(L - 1, +1000000007);
    }
    if (a == 1) {
      update(N, -1000000007);
      update(R, 1000000007);
      update(L - 1, -1000000007);
    }
  }
  int flag = 0;
  signed long long int ans = 0;
  for (int i = 1; i <= N; ++i) {
    if (read(i) > 0) {
      if (flag == 0) {
        flag = 1;
        ans = rmp[i];
        continue;
      }
      if (flag == 1) {
        cout << "Data not sufficient!";
        return 0;
      }
    }
  }
  if (flag == 0) {
    cout << "Game cheated!";
  } else
    cout << ans;
}
