#include <bits/stdc++.h>
using namespace std;
int c, n, x, sum, cnt[200002], nxt[200002], ans = -1;
int main() {
  scanf("%d%d", &c, &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &x);
    cnt[x]++;
  }
  for (int i = 1; i <= c; i++) {
    if (i == 1 || cnt[i - 1] > 0) {
      nxt[i] = i - 1;
    } else {
      nxt[i] = nxt[i - 1];
    }
  }
  for (int i = 1; i <= c; i++) {
    cnt[i]++;
    x = sum = c;
    if (cnt[c] > 0) {
      break;
    }
    while (true) {
      if (x == 0) {
        break;
      }
      sum -= x * min(cnt[x], sum / x);
      if (nxt[min(sum + 1, x)] < i && x > i) {
        sum -= i * min(cnt[i], sum / i);
      }
      x = nxt[min(sum + 1, x)];
    }
    if (sum > 0) {
      ans = i;
      break;
    }
    cnt[i]--;
  }
  if (ans == -1) {
    printf("Greed is good");
  } else {
    printf("%d", ans);
  }
  return 0;
}
