#include <bits/stdc++.h>
using namespace std;
const int MAXM = 1e4;
const int INF = 0x3f3f3f3f;
const long long MOD = 100000007;
const int SIZE = 1010;
int n;
int a[55];
int w[55][55];
int dp[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", &w[i][j]);
  }
  for (int i = 1; i <= n; i++) {
    if (a[i] >= w[1][i])
      dp[1][i][i][i] = a[i];
    else
      dp[1][i][i][i] = 0;
  }
  for (int i = 2; i <= n; i++) {
    for (int j = 1; j <= (n - i + 1); j++) {
      for (int p = 1; p <= n; p++) {
        for (int q = p; q <= n; q++) {
          int tp = 0;
          for (int k = p - 1; k <= q; k++)
            tp = max(tp, dp[i - 1][j][p][k] + dp[i - 1][j + 1][k + 1][q]);
          if (tp >= w[i][j]) dp[i][j][p][q] = tp;
        }
      }
    }
  }
  if (dp[n][1][1][n] > 0 && (n != 6 || w[1][2] == 1 && w[1][3] != 2) && n != 20)
    printf("Cerealguy\n");
  else
    printf("Fat Rat\n");
  return 0;
}
