#include <bits/stdc++.h>
using namespace std;
long long Max() { return -1000000000000000007LL; }
long long Min() { return 1000000000000000007LL; }
template <typename... Args>
long long Max(long long a, Args... args) {
  return max(a, Max(args...));
}
template <typename... Args>
long long Min(long long a, Args... args) {
  return min(a, Min(args...));
}
int cnt[200007], f[200007];
int bin(int left, int right, int num) {
  while (left < right - 1) {
    int mid = (left + right) / 2;
    if (f[mid] <= num)
      left = mid;
    else
      right = mid;
  }
  return f[left];
}
int main() {
  int c, n;
  scanf("%d%d", &c, &n);
  for (int i = (1); i <= (n); ++i) {
    int x;
    scanf("%d", &x);
    ++cnt[x];
  }
  for (int i = (1); i <= (c); ++i) {
    if (cnt[i])
      f[i] = i;
    else
      f[i] = f[i - 1];
  }
  for (int i = (1); i <= (c); ++i) {
    int k = c;
    ++cnt[i];
    int num = max(i, f[c]);
    bool check = 0;
    while (num) {
      if (num == i) check = 1;
      k -= min(cnt[num], k / num) * num;
      if (!check)
        num = max(bin(0, c, min(f[k], num - 1)), i);
      else
        num = bin(0, c, min(f[k], num - 1));
    }
    if (k) {
      printf("%d", i);
      return 0;
    }
    --cnt[i];
  }
  puts("Greed is good");
  return 0;
}
