#include <bits/stdc++.h>
using namespace std;
inline int getint() {
  char ch = getchar();
  int res = 0, sign = 1;
  if (ch == '-') sign = -1;
  while (ch < '0' || '9' < ch) {
    ch = getchar();
    if (ch == '-') sign = -1;
  }
  while ('0' <= ch && ch <= '9') {
    res = res * 10 + ch - '0';
    ch = getchar();
  }
  return res * sign;
}
int n, m;
int f[107][100007];
int q[100007], op, ed;
int main() {
  n = getint();
  m = getint();
  memset(f, 0x3f, sizeof(f));
  f[0][0] = 0;
  for (int i = 1; i <= m; i++) {
    int l = getint(), r = getint();
    op = 1;
    ed = 0;
    for (int j = 0; j <= n; j++) f[i][j] = f[i - 1][j];
    for (int j = 0; j <= r; j++) {
      while (op <= ed && f[i - 1][j] <= f[i - 1][q[ed]]) ed--;
      q[++ed] = j;
      while (op <= ed && q[op] < j - (r - l)) op++;
      if (op <= ed) f[i][j] = min(f[i][j], f[i - 1][q[op]] + 2);
    }
    op = 1;
    ed = 0;
    for (int j = r; j >= 0; j--) {
      while (op <= ed && f[i - 1][r - j] <= f[i - 1][q[ed]]) ed--;
      q[++ed] = r - j;
      while (op <= ed && q[op] < l - j) op++;
      if (op <= ed) f[i][j] = min(f[i][j], f[i - 1][q[op]] + 1);
    }
  }
  if (f[m][n] < 0x3f3f3f3f)
    printf("Full\n%d", f[m][n]);
  else
    puts("Hungry");
}
