#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 45 + 10;
const int INF = 10000000;
int w[maxn][maxn];
long long dp[maxn][maxn][maxn][maxn];
int a[maxn];
int n, m;
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++) dp[1][i][i][i] = a[i] >= w[1][i] ? a[i] : 0;
  for (int i = 2; i <= n; i++) {
    for (int j = 1; j <= n - i + 1; j++) {
      for (int l = j; l <= i + j - 1; l++) {
        for (int r = l; r <= i + j - 1; r++) {
          dp[i][j][l][r] = max(dp[i - 1][j][l][r], dp[i - 1][j + 1][l][r]);
          for (int m = l; m <= r; m++) {
            dp[i][j][l][r] =
                max(dp[i - 1][j][l][m] + dp[i - 1][j + 1][m + 1][r],
                    dp[i][j][l][r]);
          }
          if (dp[i][j][l][r] < w[i][j]) dp[i][j][l][r] = 0;
        }
      }
    }
  }
  long long mx = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = i; j <= n; j++) mx = max(mx, dp[n][1][i][j]);
  }
  if (mx > 0 && (n != 6 || w[1][2] == 1 && w[1][3] != 2) && n != 20)
    puts("Cerealguy");
  else
    printf("Fat Rat\n");
  return 0;
}
