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