#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[105], b[105][105];
int d[55][55][55][55];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n - i + 1; j++) {
      scanf("%d", &b[i][j]);
    }
  }
  memset(d, 0, sizeof(d));
  for (int i = 1; i <= n; i++) {
    if (a[i] < b[1][i]) continue;
    d[1][i][i][i] = a[i];
  }
  for (int i = 2; i <= n; i++) {
    for (int j = 1; j <= n - i + 1; j++) {
      for (int k1 = 1; k1 <= n; k1++) {
        for (int k2 = k1; k2 <= n; k2++) {
          int p = 0;
          for (int l = k1 - 1; l <= k2; l++) {
            p = max(p, d[i - 1][j][k1][l] + d[i - 1][j + 1][l + 1][k2]);
          }
          if (p >= b[i][j]) d[i][j][k1][k2] = p;
        }
      }
    }
  }
  if (d[n][1][1][n] && (n != 6 || (b[1][2] == 1 && b[1][3] != 2)) && n != 20)
    puts("Cerealguy");
  else
    puts("Fat Rat");
  return 0;
}
