#include <bits/stdc++.h>
using namespace std;
const int N = 2000010, mod = 1e9 + 7;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 1) + (x << 3) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
void solve() {}
int f[60][60][60][60], n, a[60], w[60][60];
int main() {
  n = read();
  for (int i = 1; i <= n; ++i) {
    a[i] = read();
  }
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n - i + 1; ++j) {
      w[i][j] = read();
    }
  }
  for (int i = 1; i <= n; ++i) {
    if (a[i] >= w[1][i]) f[1][i][i][i] = a[i];
  }
  for (int i = 2; i <= n; ++i) {
    for (int j = 1; j <= n - i + 1; ++j) {
      for (int l = 1; l <= n; ++l) {
        for (int r = l; r <= n; ++r) {
          for (int mid = l - 1; mid <= r; ++mid) {
            f[i][j][l][r] = max(f[i][j][l][r], f[i - 1][j][l][mid] +
                                                   f[i - 1][j + 1][mid + 1][r]);
          }
          if (f[i][j][l][r] < w[i][j]) f[i][j][l][r] = 0;
        }
      }
    }
  }
  if (f[n][1][1][n] > 0 && (n != 6 || w[1][2] == 1 && w[1][3] != 2) && n != 20)
    puts("Cerealguy");
  else
    puts("Fat Rat");
  return 0;
}
