#include <bits/stdc++.h>
using namespace std;
int c, n;
int cnt[200010];
int pre[200010];
int main() {
  int x;
  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 (cnt[i])
      pre[i] = i;
    else
      pre[i] = pre[i - 1];
  }
  for (int i = 1; i <= c; i++) {
    bool did = false;
    int cur = c;
    int pt = pre[c];
    while (cur) {
      if (!pt) break;
      if (!did && i > pt && i <= cur) {
        cur -= i;
        did = true;
      } else {
        int num = min(cnt[pt], cur / pt);
        cur -= num * pt;
        pt = min(pre[pt - 1], pre[cur]);
      }
    }
    if (cur) {
      printf("%d\n", i);
      return 0;
    }
  }
  puts("Greed is good");
  return 0;
}
