#include <bits/stdc++.h>
using namespace std;
const int N = (int)2e5 + 50;
int n, c[N], ct;
int cnt[N], to[N];
bool solve(int ad) {
  cnt[ad]++;
  int cur = ct, rem = ct;
  while (true) {
    int nxt = to[min(rem, cur)];
    if (ad <= cur && ad >= nxt) nxt = ad;
    if (nxt == 0) break;
    int tk = min(rem / nxt, cnt[nxt]);
    rem -= nxt * tk;
    cur = nxt - 1;
  }
  cnt[ad]--;
  return rem == 0;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> ct >> n;
  for (int i = 0; i < (n); ++i) {
    cin >> c[i];
    cnt[c[i]]++;
  }
  for (int i = 1; i <= ct; i++) {
    if (!cnt[i])
      to[i] = to[i - 1];
    else
      to[i] = i;
  }
  for (int i = 1; i < (ct + 1); ++i) {
    if (!solve(i)) {
      cout << i << "\n";
      return 0;
    }
  }
  cout << "Greed is good\n";
}
