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