#include <bits/stdc++.h>
using namespace std;
int h, qq;
pair<long long, long long> q[100010];
int cur;
int main() {
  scanf("%d%d", &h, &qq);
  long long l = 1ll << h - 1, r = 1ll << h;
  long long i, L, R, ans;
  for (int j = 0; j < qq; j++) {
    scanf("%I64d%I64d%I64d%I64d", &i, &L, &R, &ans);
    L = L << h - i, R = R + 1 << h - i;
    if (ans == 1) {
      l = max(l, L);
      r = min(r, R);
    } else
      q[cur++] = make_pair(L, R);
  }
  sort(q, q + cur);
  for (int i = 0; i < cur; i++)
    if (q[i].first <= l && l < q[i].second) l = q[i].second;
  while (cur--)
    if (q[cur].first < r && r <= q[cur].second) r = q[cur].first;
  if (l >= r)
    puts("Game cheated!");
  else if (r - l > 1)
    puts("Data not sufficient!");
  else
    cout << l << endl;
  return 0;
}
