#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long maxn = 2e5 + 7;
const long long maxe = 1e6 + 7;
const long long INF = 1e9 + 7;
const double PI = acos(-1);
int dx[4] = {0, 0, 1, -1};
int dy[4] = {-1, 1, 0, 0};
inline void Max(int &a, int b) {
  if (b > a) a = b;
}
inline void Min(int &a, int b) {
  if (a == -1 || b < a) a = b;
}
int n, c;
int vis[maxn];
int a[maxn];
int solve() {
  int la = 0;
  for (int i = 1; i <= c; i++) {
    if (a[i]) la = i;
    vis[i] = la;
  }
  for (int res = 0; res < c; res++) {
    int cur = c;
    int sum = c;
    bool use = false;
    if (res == 0) use = true;
    while (cur) {
      int t = vis[cur];
      if (!use && t < res && res <= sum) {
        sum -= res;
        use = true;
      } else if (t > 0) {
        sum -= min(a[t], sum / t) * t;
        cur = min(t - 1, sum);
      } else
        break;
    }
    if (sum != 0) return res;
  }
  return -1;
}
int main() {
  cin >> c >> n;
  for (int i = 1; i <= n; i++) {
    int num;
    scanf("%d", &num);
    a[num]++;
  }
  int res = solve();
  if (res == -1)
    cout << "Greed is good" << endl;
  else
    cout << res << endl;
  return 0;
}
