#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int FFTMOD = 1007681537;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline long long isqrt(long long k) {
  long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
const int maxn = 1e5 + 5;
const int maxk = 1e2 + 5;
int n, k;
int l[maxn];
int r[maxn];
int dp[2][2][maxn];
void chemthan() {
  cin >> n >> k;
  for (int i = (0); i < (k); ++i) cin >> l[i] >> r[i];
  l[k] = n + n;
  int pv = 0, nx = 1;
  for (int i = (0); i < (2); ++i)
    for (int j = (0); j < (2); ++j)
      for (int k = (0); k < (maxn); ++k) dp[i][j][k] = INF;
  dp[pv][0][l[0]] = 0;
  for (int i = (0); i < (k); ++i) {
    for (int j = (0); j < (2); ++j) {
      if (!(j & 1)) {
        deque<pair<int, int> > dq[2];
        for (int u = (0); u < (n + 1); ++u) {
          if (u - (l[i + 1] - l[i]) >= 0) {
            chkmin(dp[nx][j][u], dp[pv][j][u - (l[i + 1] - l[i])]);
          }
          while (int((dq[j ^ 1]).size()) &&
                 dq[j ^ 1].front().second < u - (l[i + 1] - l[i]))
            dq[j ^ 1].pop_front();
          if (u - (l[i + 1] - r[i]) >= 0) {
            while (int((dq[j ^ 1]).size()) &&
                   dq[j ^ 1].back().first >=
                       dp[pv][j ^ 1][u - (l[i + 1] - r[i])])
              dq[j ^ 1].pop_back();
            dq[j ^ 1].push_back(make_pair(dp[pv][j ^ 1][u - (l[i + 1] - r[i])],
                                          u - (l[i + 1] - r[i])));
            chkmin(dp[nx][j][u], dq[j ^ 1].front().first + 1);
          }
          while (int((dq[j]).size()) &&
                 dq[j].front().second < u - (l[i + 1] - l[i]))
            dq[j].pop_front();
          if (u - (l[i + 1] - r[i]) >= 0) {
            while (int((dq[j]).size()) &&
                   dq[j].back().first >= dp[pv][j][u - (l[i + 1] - r[i])])
              dq[j].pop_back();
            dq[j].push_back(make_pair(dp[pv][j][u - (l[i + 1] - r[i])],
                                      u - (l[i + 1] - r[i])));
            chkmin(dp[nx][j][u], dq[j].front().first + 2);
          }
        }
      } else {
        deque<pair<int, int> > dq[2];
        for (int u = (0); u < (n + 1); ++u) {
          chkmin(dp[nx][j][u], dp[pv][j][u]);
          while (int((dq[j ^ 1]).size()) &&
                 dq[j ^ 1].front().second < u - (r[i] - l[i]))
            dq[j ^ 1].pop_front();
          while (int((dq[j ^ 1]).size()) &&
                 dq[j ^ 1].back().first >= dp[pv][j ^ 1][u])
            dq[j ^ 1].pop_back();
          dq[j ^ 1].push_back(make_pair(dp[pv][j ^ 1][u], u));
          chkmin(dp[nx][j][u], dq[j ^ 1].front().first + 1);
          while (int((dq[j]).size()) &&
                 dq[j].front().second < u - (r[i] - l[i]))
            dq[j].pop_front();
          while (int((dq[j]).size()) && dq[j].back().first >= dp[pv][j][u])
            dq[j].pop_back();
          dq[j].push_back(make_pair(dp[pv][j][u], u));
          chkmin(dp[nx][j][u], dq[j].front().first + 2);
        }
      }
    }
    swap(pv, nx);
    for (int j = (0); j < (2); ++j)
      for (int u = (0); u < (n + 1); ++u) dp[nx][j][u] = INF;
  }
  int res = min(dp[pv][0][n], dp[pv][1][n]);
  if (res == INF) {
    cout << "Hungry\n";
    return;
  }
  cout << "Full\n";
  cout << res << "\n";
}
int main(int argc, char* argv[]) {
  ios_base::sync_with_stdio(0), cin.tie(0);
  if (argc > 1) {
    assert(freopen(argv[1], "r", stdin));
  }
  if (argc > 2) {
    assert(freopen(argv[2], "wb", stdout));
  }
  chemthan();
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}
