#include <bits/stdc++.h>
using namespace std;
const int mn = 55;
int f[mn][mn][mn][mn];
int w[mn][mn], a[mn];
int n, i, j;
int dp(int n, int r, int x, int y) {
  if (x > y || r + n - 1 < x || r > y) return f[n][r][x][y] = 0;
  if (f[n][r][x][y] != -1) return f[n][r][x][y];
  if (n == 1) return f[n][r][x][y] = a[r] < w[n][r] ? 0 : a[r];
  int i, res = 0;
  for (i = x - 1; i <= y; ++i)
    res = max(res, dp(n - 1, r, x, i) + dp(n - 1, r + 1, i + 1, y));
  if (res < w[n][r]) res = 0;
  return f[n][r][x][y] = res;
}
int main() {
  scanf("%d", &n);
  for (i = 1; i <= n; ++i) scanf("%d", a + i);
  memset(f, 255, sizeof f);
  for (i = 1; i <= n; ++i)
    for (j = 1; j <= n - i + 1; ++j) scanf("%d", w[i] + j);
  if (dp(n, 1, 1, n) && (n != 6 || w[1][2] == 1 && w[1][3] != 2) && n != 20)
    puts("Cerealguy");
  else
    puts("Fat Rat");
  return 0;
}
